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.


📚 Artikel Terkait di Wikipedia

Alexander Vardy

in coding theory. He held the Jack Keil Wolf Endowed Chair in Electrical Engineering at the University of California, San Diego. The Parvaresh–Vardy codes

Folded Reed–Solomon code

bundling of codeword symbols. Folded Reed–Solomon codes are also a special case of Parvaresh–Vardy codes. Using optimal parameters one can decode with a

List decoding

Reed–Solomon codes up to 1 − R {\displaystyle 1-{\sqrt {R}}} errors by Madhu Sudan and his then doctoral student Venkatesan Guruswami. Parvaresh–Vardy '05 –