Explicit capacity-achieving list-decodable codes or decoding up to the singleton bound using folded Reed-Solomon codes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 1-10

  Guruswami, Venkatesan ^a   Rudra, Atri ^a  

^a University of Washington   (United States)

Author keywords

Algebraic decoding; Channel Capacity; List Decoding; Reed Solomon codes; Zyablov bound

Indexed keywords

ALGEBRAIC DECODING; LIST DECODING; REED-SOLOMON CODES; ZYABLOV BOUND;

ALGORITHMS; CHANNEL CAPACITY; DECODING; ERROR CORRECTION; POLYNOMIALS;

CODES (SYMBOLS);

EID: 33748105468     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. P. Elias. List decoding for noisy channels. Technical Report 335, Research Laboratory of Electronics, MIT, 1957.
2. P. Elias. Error-correcting codes for list decoding. IEEE Transactions on Information Theory, 37:5-12, 1991.
3. V. Guruswami. Limits to list decodability of linear codes. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), pages 802-811, 2002.
4. V. Guruswami. List Decoding of Error-Correcting Codes. Lecture Notes in Computer Science 3282. Springer, 2004.
5. V. Guruswami. Algebraic-geometric generalizations of the Parvaresh-Vardy codes. ECCC Technical Report TR05-132, 2005.
6. V. Guruswami, J. Hȧstad, M. Sudan, and D. Zuckerman. Combinatorial bounds for list decoding. IEEE Transactions on Information Theory, 48:1021-1035, May 2002.
7. V. Guruswami and P. Indyk. Expander-based constructions of efficiently decodable codes. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), pages 658-667, 2001.
8. V. Guruswami and P. Indyk. Linear time encodable/decodable codes with near-optimal rate. IEEE Transactions on Information Theory, 51(10):3393-3400, October 2005.
9. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45:1757-1767, 1999.
10. V. Y. Krachkovsky. Reed-Solomon codes for correcting phased error bursts. IEEE Transactions on Information Theory, 49(11):2975-2984, November 2003.
11. R. Lidl and H. Niederreiter. Introduction to Finite Fields and their applications. Cambridge University Press, Cambridge, MA, 1986.
12. F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 43nd Annual Symposium on Foundations of Computer Science (FOCS), pages 285-294, 2005.
13. A. Patthak. Reducing the alphabet size of the Parvaresh-Vardy code using Algebraic Geometry codes. Manuscript, September 2005.
14. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. Journal of the ACM, 52(2):172-216, March 2005.
15. M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.
16. M. Sudan. List decoding: Algorithms and applications. SIGACT News, 31:16-27, 2000.
17. J. M. Wozencraft. List Decoding, Quarterly Progress Report, Research Laboratory of Electronics, MIT, 48:90-95, 1958.
18. V. V. Zyablov and M. S. Pinsker. List cascade decoding. Problems of Information Transmission, 17(4):29-34, 1981 (in Russian);
19. Problems of Information Transmission, pp. 236-240 (in English), 1982.