Parvaresh–Vardy code explained

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

Notes and References

  1. Book: Parvaresh, Farzad. Alexander Vardy. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) . Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time . October 2005. 285–294. 10.1109/SFCS.2005.29. 0-7695-2468-0. 14938904 .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Parvaresh–Vardy code".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.