Jump to content

Parvaresh–Vardy code

Add links
From Wikipedia, the free encyclopedia

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[2] list-decoding.

See also

[edit]

References

[edit]
  1. ↑ Parvaresh, Farzad; Alexander Vardy (October 2005). "Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 285–294. doi:10.1109/SFCS.2005.29. ISBN 0-7695-2468-0. S2CID 14938904.
  2. ↑ amirhoseinbghr91 (2026-07-10), amirhoseinbghr91/pv-codes, retrieved 2026-07-10{{citation}}: CS1 maint: numeric names: authors list (link)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Parvaresh–Vardy_code&oldid=1363485806"