From Wikipedia, the free encyclopedia

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". 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.


P ≟ NP 

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

Retrieved from " https://en.wikipedia.org/?title=Parvaresh–Vardy_code&oldid=1166978362"