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.

See also

Reed–Solomon code
Folded Reed–Solomon code

References

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. ISBN 0-7695-2468-0.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.