Optimal rate list decoding via derivative codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6845 LNCS, Issue , 2011, Pages 593-604

  Guruswami, Venkatesan ^a   Wang, Carol ^a  

^a Carnegie Mellon University   (United States)

Author keywords

list error correction; multiplicity codes; noisy polynomial interpolation; pseudorandomness; Reed Solomon codes; subspace evasive sets

Indexed keywords

LIST ERROR CORRECTIONS; MULTIPLICITY CODES; NOISY POLYNOMIAL INTERPOLATION; PSEUDORANDOMNESS; REED SOLOMON; SUBSPACE-EVASIVE SETS;

COMBINATORIAL OPTIMIZATION; DECODING; LINEAR SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; REED-SOLOMON CODES;

APPROXIMATION ALGORITHMS;

EID: 80052389088     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22935-0_50     Document Type: Conference Paper

References (14)

1. Bombieri, E., Kopparty, S.: List decoding multiplicity codes (2011) (manuscript)
2. Gemmell, P., Sudan, M.: Highly resilient correctors for multivariate polynomials. Information Processing Letters 43(4), 169-174 (1992)
3. Guruswami, V.: List decoding with side information. In: Proceedings of the 18th IEEE Conference on Computational Complexity (CCC), pp. 300-309 (2003)
4. Guruswami, V.: Algorithmic Results in List Decoding. Foundations and Trends in Theoretical Computer Science (FnT-TCS), vol. 2. NOWpublishers (January 2007)
5. Guruswami, V.: Cyclotomic function fields, Artin-Frobenius automorphisms, and list error-correction with optimal rate. Algebra and Number Theory 4(4), 433-463 (2010)
6. Guruswami, V.: Linear-algebraic list decoding of folded Reed-Solomon codes. In: Proceedings of the 26th IEEE Conference on Computational Complexity (June 2011)
7. Guruswami, V., Rudra, A.: Limits to list decoding Reed-Solomon codes. IEEE Transactions on Information Theory 52(8), 3642-3649 (2006)
8. Guruswami, V., Rudra, A.: Explicit codes achieving list decoding capacity: Error-correction up to the Singleton bound. IEEE Transactions on Information Theory 54(1), 135-150 (2008)
9. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and Algebraic-geometric codes. IEEE Transactions on Information Theory 45(6), 1757-1767 (1999)
10. Kopparty, S., Saraf, S., Yekhanin, S.: High-rate codes with sublinear-time decoding. Electronic Colloquium on Computational Complexity, TR10-148 (2010)
11. Parvaresh, F., Vardy, A.: Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 285-294 (2005)
12. Sudan, M.: Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity 13(1), 180-193 (1997)
13. Vadhan, S.: Pseudorandomness. Foundations and Trends in Theoretical Computer Science (FnT-TCS). NOW publishers (2010) (to appear) Draft available at, http://people.seas.harvard.edu/~salil/pseudorandomness/
14. Welch, L.R., Berlekamp, E.R.: Error correction of algebraic block codes. US Patent Number 4, 633, 470 (December 1986)