Linear-Algebraic List Decoding of Folded Reed-Solomon Codes

  title={Linear-Algebraic List Decoding of Folded Reed-Solomon Codes},
  author={Venkatesan Guruswami},
  journal={2011 IEEE 26th Annual Conference on Computational Complexity},
Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any " > 0, the author and Rudra (2006, 08) presented an nO(1=") time algorithm to list decode appropriate folded RS codes of rate R from a fraction 1--R--e" of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices… CONTINUE READING
Highly Cited
This paper has 67 citations. REVIEW CITATIONS
38 Extracted Citations
27 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 38 extracted citations

68 Citations

Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 27 references

Explicit codes achieving list decoding capacity: Error-correction up to the Singleton bound

  • V. Guruswami, A. Rudra
  • IEEE Transactions on Information Theory, vol. 54…
  • 2008
Highly Influential
8 Excerpts

Interpolation and list decoding of algebraic codes

  • K. Brander
  • Ph.D. dissertation, Technical University of…
  • 2010
2 Excerpts

List decoding Folded Reed-Solomon codes

  • V. Guruswami
  • 2010, lecture notes,…
  • 2010
2 Excerpts

Decoding Folded Reed-Solomon codes using Hensel-lifting

  • P. Beelen, K. Brander
  • Gröbner Bases, Coding, and Cryptography. Springer…
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…