Linear-algebraic list decoding of folded Reed-Solomon codes

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2011, Pages 77-85

  Guruswami, Venkatesan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE SOLUTION; DECODING COMPLEXITY; EXTENSION FIELD; LINEAR POLYNOMIALS; LINEAR-ALGEBRAIC; LIST DECODING; LOW-DIMENSIONAL SUBSPACE; MONTE CARLO; MULTIVARIATE POLYNOMIAL; PSEUDO RANDOM; PSEUDORANDOMNESS; QUADRATIC TIME; ROOTFINDING; RS CODES; STEP-OVERS; TIME ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTERPOLATION; LINEAR SYSTEMS; POLYNOMIALS; REED-SOLOMON CODES;

DECODING;

EID: 80052004403     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2011.22     Document Type: Conference Paper

References (26)

1. W. W. Peterson, "Encoding and error-correction procedures for Bose-Chaudhuri codes," IEEE Transactions on Information Theory, vol. 6, pp. 459-470, 1960.
2. M. Sudan, "List decoding: Algorithms and applications," SIGACT News, vol. 31, pp. 16-27, 2000.
3. L. Trevisan, "Some applications of coding theory in computational complexity," Quaderni di Matematica, vol. 13, pp. 347-424, 2004.
4. S. P. Vadhan, "The unified theory of pseudorandomness," in Proceedings of the International Congress of Mathematicians, 2010.
5. M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound," Journal of Complexity, vol. 13, no. 1, pp. 180-193, 1997. (Pubitemid 127172728)
6. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and Algebraic-geometric codes," IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 1757-1767, 1999. (Pubitemid 32871911)
7. F. Parvaresh and A. Vardy, "Correcting errors beyond the Guruswami-Sudan radius in polynomial time," in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 285-294. (Pubitemid 44375740)
8. V. Guruswami and A. Rudra, "Explicit codes achieving list decoding capacity: Error-correction up to the Singleton bound," IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 135-150, 2008.
9. S. Vadhan, Pseudorandomness, ser. Foundations and Trends in Theoretical Computer Science (FnT-TCS). NOW publishers, 2010, to appear. Draft available at http://people.seas.harvard.edu/~salil/pseudorandomness/.
10. V. Guruswami, "List decoding Folded Reed-Solomon codes," 2010, lecture notes, http://www.cs.cmu.edu/~venkatg/teaching/codingtheory/notes/ notes11.pdf.
11. P. Pudlák and V. Rödl, "Pseudorandom sets and explicit constructions of Ramsey graphs," in Complexity of Computations and Proofs. Quad. Mat., 13, Dept. Math., Seconda Univ. Napoli, Caserta, 2004, pp. 327-346.
12. L. R. Welch and E. R. Berlekamp, "Error correction of algebraic block codes," US Patent Number 4,633,470, December 1986.
13. P. Gemmell and M. Sudan, "Highly resilient correctors for multivariate polynomials," Information Processing Letters, vol. 43, no. 4, pp. 169-174, 1992.
14. V. Guruswami and A. Patthak, "Correlated Algebraic-Geometric codes: Improved list decoding over bounded alphabets," Mathematics of Computation, vol. 77, no. 261, pp. 447-473, 2008.
15. K. Brander, "Interpolation and list decoding of algebraic codes," Ph.D. dissertation, Technical University of Denmark, 2010.
16. V. Guruswami, "List decoding with side information," in Proceedings of the 18th IEEE Conference on Computational Complexity (CCC), 2003, pp. 300-309.
17. P. Beelen and K. Brander, "Decoding Folded Reed-Solomon codes using Hensel-lifting," in Gröbner Bases, Coding, and Cryptography. Springer-Verlag, 2009, pp. 389-394.
18. M. D. Huang and A. K. Narayanan, "Folded algebraic geometric codes from Galois extensions," ArXiv CoRR, http://arxiv.org/abs/0901.1162, 2009.
19. V. Guruswami and C. Wang, "Optimal rate list decoding via derivative codes," 2011, manuscript.
20. E. Bombieri and S. Kopparty, "List decoding multiplicity codes," 2011, manuscript.
21. S. Kopparty, S. Saraf, and S. Yekhanin, "High-rate codes with sublinear-time decoding," Electronic Colloquium on Computational Complexity, TR10-148, 2010.
22. P. Braß and C. Knauer, "On counting point-hyperplane incidences," Comput. Geom., vol. 25, no. 1-2, pp. 13-20, 2003.
23. V. Guruswami, J. Håstad, M. Sudan, and D. Zuckerman, "Combinatorial bounds for list decoding," IEEE Transactions on Information Theory, vol. 48, no. 5, pp. 1021-1035, 2002.
24. A. Gabizon and R. Raz, "Deterministic extractors for affine sources over large fields," Combinatorica, vol. 28, no. 4, pp. 415-440, 2008.
25. M. Bellare and J. Rompel, "Randomness-efficient oblivious sampling," in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 276-287.
26. P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry. Springer, New York, 2005.