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

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.


This article is issued from Wikipedia - version of the Monday, August 10, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.