Concatenated codes can achieve list-decoding capacity

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 258-267

  Guruswami, Venkatesan ^a   Rudra, Atri ^b  

^a University of Washington   (United States)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; CONCATENATED CODING; GOOD CODES; HIGH PROBABILITY; RANDOM CODING; REED-SOLOMON (RS) CODING;

DECODING; REED-SOLOMON CODES;

CODES (SYMBOLS);

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

References (14)

1. E. L. Blokh and Victor V. Zyablov. Existence of linear concatenated binary codes with optimal correcting properties. Prob. Peredachi Inform., 9:3-10, 1973.
2. Ilya I. Dumer. Concatenated codes and their multilevel generalizations. In V. S. Pless and W. C. Huffman, editors, Handbook of Coding Theory, volume 2, pages 1911-1988. North Holland, 1998.
3. G. David Forney. Concatenated Codes. MIT Press, Cambridge, MA, 1966.
4. Venkatesan Guruswami, Johan Hastad, Madhu Sudan, and David Zuckerman. Combinatorial bounds for list decoding. IEEE Transactions on Information Theory, 48(5):1021-1035, 2002.
5. Venkatesan Guruswami and Piotr Indyk. Expanderbased constructions of efficiently decodable codes. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 658-667, 2001.
6. Venkatesan Guruswami and Atri Rudra. Explicit capacity-achieving list-decodable codes. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 1-10, May 2006.
7. Venkatesan Guruswami and Atri Rudra. Limits to list decoding Reed-Solomon codes. IEEE Transactions on Information Theory, 52(8), August 2006.
8. Venkatesan Guruswami and Atri Rudra. Better binary list-decodable codes via multilevel concatenation. In Proceedings of the 11th International Workshop on Randomization and Computation (RANDOM), pages 554-568, 2007.
9. F. J. MacWilliams and Neil J. A. Sloane. The Theory of Error-Correcting Codes. Elsevier/North-Holland, Amsterdam, 1981.
10. Jørn Justesen. A class of constructive asymptotically good algebraic codes. IEEE Transactions on Information Theory, 18:652-656, 1972.
11. Atri Rudra. List Decoding and Property Testing of Error Correcting Codes. PhD thesis, University of Washington, 2007.
12. Michael Sipser and Daniel Spielman. Expander codes. IEEE Transactions on Information Theory, 42(6):1710-1722, 1996.
13. Daniel Spielman. The complexity of error-correcting codes. In 11th International Symposium on Fundamentals of Computation 'Theory, Krakow, Poland, LNCS #1279, pp. 67-84, 1997
14. Christian Thommesen. The existence of binary linear concatenated codes with Reed-Solomon outer codes which asymptotically meet the Gilbert-Varshamov bound. IEEE Transactions on Information Theory, 29(6):850-853, November 1983.