Combinatorial bounds for list decoding

IEEE Transactions on Information Theory

Volumn 48, Issue 5, 2002, Pages 1021-1034

  Guruswami, Venkatesan ^b   Håstad, Johan ^c   Sudan, Madhu ^a,d   Zuckerman, David ^e  

^a IEEE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e University of Texas at Austin   (United States)

Author keywords

Concatenated codes; Error correcting codes; List decoding; Reed Solomon (RS) code

Indexed keywords

COMBINATORIAL BOUNDS; LIST DECODING;

ALGORITHMS; ASYMPTOTIC STABILITY; COMBINATORIAL MATHEMATICS; DECODING; ERROR CORRECTION; POLYNOMIALS;

BINARY CODES;

EID: 0036567053     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.995539     Document Type: Article

References (25)

1. Channel capacities for list codes
2. A new upper bound on codes decodable into size-2 lists
3. Bounds for codes in the case of list decoding of finite volume
4. Lower bound for the linear multiple packing of the binary Hamming space
5. Hardness of approximating the minimum distance of a linear code
6. List decoding for noisy channels
7. Error-correcting codes for list decoding
8. Learning polynomials with queries: The highly noisy case
9. Improved decoding of Reed-Solomon and algebraic-geometric codes
10. List decoding algorithms for certain concatenated codes
11. Bounds on list decoding of MDS codes
12. Lower bounds to error probability for coding on discrete memoryless channels
13. List decoding of algebraic-geometric codes
14. Decoding of Reed-Solomon codes beyond the error-correction bound
15. List decoding: Algorithms applications
16. Modular curves, Shimura curves, and codes better than the Varshamov-Gilbert bound
17. Improved lower bounds on the sizes of error-correcting codes for list decoding
18. List decoding
19. List cascade decoding