On the list-decodability of random linear codes

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 718-725

  Guruswami, Venkatesan ^a   Hastad, Johan ^b   Kopparty, Swastik ^c  

^a Carnegie Mellon University ^*  (United States)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Hamming bound; linear codes; list decoding; probabilistic method; random coding

Indexed keywords

HAMMING BOUND; LINEAR CODES; LIST DECODING; PROBABILISTIC METHODS; RANDOM CODING;

DECODING;

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

References (18)

1. P. Elias, List decoding for noisy channels Research Lab. of Electronics, MIT, Cambridge, MA, 1957, Tech. Rep. 335.
2. J. M. Wozencraft, List decoding Research Lab. of Electronics, MIT, Cambridge, 1958, vol. 58, pp. 90-95, Quarterly Progress Report.
3. P. Elias, "Error-correcting codes for list decoding," IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 5-12, Jan. 1991.
4. V. V. Zyablov and M. S. Pinsker, "List cascade decoding," (in Russian) Problems of Inform. Trans., vol. 17, no. 4, pp. 29-34, 1981.
5. A. Rudra, "Limits to list decoding random codes," in COCOON, ser. Lecture Notes in Computer Science, H. Q. Ngo, Ed. Berlin: Springer, 2009, vol. 5609, pp. 27-36.
6. V. M. Blinovsky, "Bounds for codes in the case of list decoding of finite volume," Problems of Inform. Trans., vol. 22, no. 1, pp. 7-19, 1986.
7. V. M. Blinovsky, "Code bounds for multiple packings over a nonbinary finite alphabet," Problems of Inform. Trans., vol. 41, no. 1, pp. 23-32, 2005.
8. V. M. Blinovsky, "On the convexity of one coding-theory function," Problems of Inform. Trans., vol. 44, no. 1, pp. 34-39, 2008.
9. V. Guruswami and A. D. Smith, "Codes for computationally simple channels: Explicit constructions with optimal rate," in Proc. 51st IEEE Symp. Foundations of Computer Science., 2010, arxiv:1004.4017[cs. IT].
10. V. Guruswami and P. Indyk, "Expander-based constructions of efficiently decodable codes," in Proc. 42nd Annu. IEEE Symp. Foundations of Computer Science, 2001, pp. 658-667.
11. V. Guruswami, J. Håstad, M. Sudan, and D. Zuckerman, "Combinatorial bounds for list decoding," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1021-1035, May 2002.
12. V. M. Blinovsky, Asymptotic Combinatorial Coding Theory. Boston, MA: Kluwer, 1997.
13. V. K. Wei and G.-L. Feng, "Improved lower bounds on the sizes of error-correcting codes for list decoding," IEEE Trans. Inf. Theory, vol. 40, no. 2, pp. 559-563, Mar. 1994.
14. V. M. Blinovsky, "Lower bound for the linear multiple packing of the binary Hamming space," J. Combin. Theory, Ser. A, vol. 92, no. 1, pp. 95-101, 2000.
15. V. Guruswami, List Decoding of Error-Correcting Codes, ser. Lecture Notes in Computer Science. Berlin: Springer, 2004.
16. N. Sauer, "On the density of families of sets," J. Combin. Theory Ser. A, vol. 13, pp. 145-147, 1972.
17. S. Shelah, "A combinatorial problem; stability and order for models and theories in infinitary languages," Pacific J. Math., vol. 41, pp. 247-261, 1972.
18. M. G. Karpovsky and V. D. Milman, "Coordinate density of sets of vectors," Discrete Math., vol. 24, no. 2, pp. 177-184, 1978.