Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy

IEEE Transactions on Information Theory

Volumn 54, Issue 1, 2008, Pages 135-150

  Guruswami, Venkatesan ^a   Rudra, Atri ^b  

^a University of Washington   (United States)

^b State University of New York   (United States)

Author keywords

Algebraic decoding; Folded Reed Solomon codes; List decoding; List recovery; Reed Solomon codes

Indexed keywords

CODING ERRORS; DECODING; ERROR CORRECTION; POLYNOMIALS; REDUNDANCY; REED-SOLOMON CODES;

ALGEBRAIC DECODING; FOLDED REED-SOLOMON CODES; LIST RECOVERY;

CODES (SYMBOLS);

EID: 38349146703     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.911222     Document Type: Article

References (30)

1. V. Guruswami and A. Rudra, "Explicit capacity-achieving list-decodable codes," in Proc. 38th Annu. ACM Symp. Theory Comput., May 2006, pp. 1-10.
2. V. Guruswami and P. Indyk, "Expander-based constructions of efficiently decodable codes," in Proc. 42nd Annu. IEEE Symp. Found. Comput. Sci. 2001, pp. 658-667.
3. V. Guruswami and P. Indyk, "Linear-time encodable/decodable codes with near-optimal rate," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3393-3400, Oct. 2005.
4. P. Elias, List Decoding for Noisy Channels List decoding for noisy channels, Tech. Rep. 335, 1957.
5. J. M. Wozencraft, "List Decoding," Quart. Progr. Rep., Res. Lab. Electron., MIT, vol. 48, pp. 90-95, 1958.
6. O. Goldreich and L. A. Levin, "A hard-core predicate for all one-way functions," in Proc. 21st Annu. ACM Symp. Theory Comput., 1989, pp. 25-32.
7. M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound," J. Complex., vol. 13, no. 1, pp. 180-193, 1997.
8. V. V. Zyablov and M. S. Pinsker, "List cascade decoding," Probl. Inf. Trans., vol. 17, no. 4, pp. 29, 236-34, 240, 1981, 1982, (in Russian), (in English),.
9. P. Elias, "Error-correcting codes for list decoding," IEEE Trans. Inf. Theory, vol. 37, pp. 5-12, 1991.
10. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometric codes," IEEE Trans. Inf. Theory, vol. 45, pp. 1757-1767, 1999.
11. M. Sudan, "List decoding: Algorithms and applications," SIGACT News vol. 31, pp. 16-27, 2000.
12. V. Guruswami, "List decoding of error-correcting codes," in Series in Lecture Notes in Computer Science. New York: Springer, 2004, no. 3282.
13. V. Guruswami, "Limits to list decodability of linear codes," in Proceedings of the 34th ACM Symposium on Theory of Computing, 2002, pp. 802-811.
14. F. Parvaresh and A. Vardy, "Correcting errors beyond the Guruswami-Sudan radius in polynomial time," in Proce. 46th Annu. IEEE Symp. Found. Comput. Sci., 2005, pp. 285-294.
15. V. Y. Krachkovsky, "Reed-Solomon codes for correcting phased error bursts," IEEE Trans. Inf. Theory, vol. 49, no. 11, pp. 2975-2984, Nov. 2003.
16. V. Guruswami, J. Håstad, M. Sudan, and D. Zuckerman, "Combinatorial bounds for list decoding," IEEE Trans. Inf. Theory, vol. 48, no. 5, pp. 1021-1035, 2002.
17. V. Guruswami, Algorithmic Results in List Decoding, ser. Foundations and Trends in Theoretical Computer Science (FnT-TCS) (Issue 2). New York: NOW publishers, 2007, vol. 2.
18. D. Coppersmith and M. Sudan, "Reconstructing curves in three (and higher) dimensional spaces from noisy data," in Proc. 35th Annu. ACM Symp. Theory Comput., Jun. 2003, pp. 136-142.
19. D. Bleichenbacher, A. Kiayias, and M. Yung, "Decoding interleaved Reed-Solomon codes over noisy channels," Theoret. Comput. Sci., vol. 379, no. 3, pp. 348-360, 2007.
20. F. Parvaresh and A. Vardy, "Multivariate interpolation decoding beyond the Guruswami-Sudan radius," in Proc. 42nd Allerton Conf. Commun., Contr. Comput., 2004.
21. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. Cambridge, U.K.: Cambridge University Press, 1986.
22. E. Berlekamp, "Factoring polynomials over large finite fields," Math. Comput., vol. 24, pp. 713-735, 1970.
23. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 49, no. 11, pp. 2809-2825, Nov. 2003.
24. V. Guruswami and A. Patthak, "Correlated Algebraic-Geometric codes: Improved list decoding over bounded alphabets," in Proc. 47th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), Oct. 2006, pp. 227-236.
25. V. Guruswami and A. Rudra, "Better binary list-decodable codes via multilevel concatenation," in Proc. 11th Int. Workshop Random. Comput., Aug. 2007, pp. 554-568.
26. R. Shaltiel and C. Umans, "Simple extractors for all min-entropies and a new pseudo-random generator," J. ACM, vol. 52, no. 2, pp. 172-216, 2005.
27. V. Guruswami, C. Umans, and S. P. Vadhan, "Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes," in Proc. 22nd Annu. IEEE Conf. Comput. Complex., 2007, pp. 96-108.
28. V. Guruswami and A. Rudra, "Concatenated codes can achieve list decoding capacity," in Proc. 19th Annu. ACM-SIAM Symp. Discr. Algor. Jan. 2008, to appear.
29. R. Koetter, "On optimal weight assignments for multivariate interpolation list-decoding," in Proc. 2006 IEEE Inf. Theory Workshop, Mar. 2006, pp. 37-41.
30. V. Guruswami and M. Sudan, "Decoding concatenated codes using soft information," in Proc. 17th Annu. IEEE Conf. Comput. Complex. (CCC) 2002, pp. 148-157.