Jump to content

Parvaresh–Vardy code

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Tom.Reding (talk | contribs) at 20:58, 13 June 2016 (Fix Category:Pages using citations with accessdate and no URL when perm identifier present (doi|bibcode|arxiv|pmid|jstor|isbn|issn|lccn|oclc|ismn|hdl): rem access-date using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Parvaresh–Vardy codes are a family of error-correcting codes first described in 2005 by Farzad Parvaresh and Alexander Vardy.[1] They can be used for efficient list-decoding.

See also

References

  1. ^ Parvaresh, Farzad; Alexander Vardy (October 2005). "Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time". Proceedings of the 2005 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05): 285–294. doi:10.1109/SFCS.2005.29.


P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Parvaresh–Vardy_code&oldid=725143864"