Parvaresh–Vardy code

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.

References

^ Parvaresh, Farzad (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. {{cite journal}}: |access-date= requires |url= (help); Unknown parameter |coauthors= ignored (|author= suggested) (help); Unknown parameter |month= ignored (help)

P ≟ NP

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

[pv05-1] Parvaresh, Farzad (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. {{cite journal}}: |access-date= requires |url= (help); Unknown parameter |coauthors= ignored (|author= suggested) (help); Unknown parameter |month= ignored (help)

[1]

See also

References