A lower bound on list size for list decoding

IEEE Transactions on Information Theory

Volumn 56, Issue 11, 2010, Pages 5681-5688

  Guruswami, Venkatesan ^a   Vadhan, Salil ^b  

^a Carnegie Mellon University   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Bounds on codes; list decoding; probabilistic method; random codes; randomness extractors

Indexed keywords

BOUNDS ON CODES; LIST DECODING; PROBABILISTIC METHODS; RANDOM CODES; RANDOMNESS EXTRACTORS;

INFORMATION THEORY; RANDOM PROCESSES;

DECODING;

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

References (15)

1. V. Guruswami and S. Vadhan, "A lower bound on list size for list decoding," in Proc. 8th Int. Workshop Randomization Computat. (RANDOM'05), Berkeley, CA, Aug. 2005, Lecture Notes in Computer Science, pp. 318-329.
2. V. M. Blinovsky, "Bounds for codes in the case of list decoding of finite volume," Probl. Inf. Transm., vol.22, no.1, pp. 7-19, 1986.
3. P. Elias, List Decoding for Noisy Channels Res. Lab. Electron., Mass. Inst. Technol., Cambridge, MA, Tech. Rep. 335, 1957.
4. J. M. Wozencraft, List decoding Res. Lab. Electron., Mass. Inst. Technol., Cambridge, Quarterly Progress Report no. 48, 1958, pp. 90-95.
5. P. Elias, "Error-correcting codes for list decoding," IEEE Trans. Inf. Theory, vol.37, pp. 5-12, 1991.
6. V. Guruswami, J. Hastad, M. Sudan, and D. Zuckerman, "Combinatorial bounds for list decoding," IEEE Trans. Inf. Theory, vol.48, pp. 1021-1035, 2002.
7. A. Ta-Shma, "Bounds for dispersers, extractors, and depth-two superconcentrators," SIAM J. Discrete Math., vol.13, no.1, pp. 2-24, 2000.
8. L. Trevisan, "Extractors and pseudorandom generators," J. ACM, vol.48, no.4, pp. 860-879, Jul. 2001.
9. A. Ta-Shma and D. Zuckerman, "Extractor codes," IEEE Trans. Inf. Theory, vol.50, pp. 3015-3025, 2004.
10. V. Guruswami, "List decoding from erasures: Bounds and code constructions," IEEE Trans. Inf. Theory, vol.49, pp. 2826-2833, 2003.
11. V. M. Blinovsky, "Code bounds for multiple packings over a nonbinary finite alphabet," Probl. Inf. Transm., vol.41, no.1, pp. 23-32, 2005.
12. V. M. Blinovsky, "On the convexity of one coding-theory function," Probl. Inf. Transm., vol.44, no.1, pp. 34-39, 2008.
13. A. Rudra, "Limits to list decoding random codes," in Proc. 15th Annu. Int. Conf. Comput. Combinatorics, Jul. 2009, pp. 27-36.
14. D. Dubhashi and S. Sen, "Concentration of measure for randomized algorithms: Techniques and analysis," in Handbook of Randomized Computing, S. Rajasekaran, Ed. et al. Norwell, MA: Kluwer, 2001, vol.1, ch. 3, pp. 35-100.
15. S. P. Vadhan, Pseudorandomness, ser. Foundations and Trends in Theoretical Computer Science. Hanover, MA: Now, 2010, to be published.