Jump to content

Parvaresh–Vardy code

Add links
From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Citation bot (talk | contribs) at 23:58, 24 July 2023 (Alter: title, template type. Add: s2cid, chapter. Removed parameters. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 1351/2384). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

[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.


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=1166978362"