Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
List decoding: algorithms and applications
ACM SIGACT News
Computing From Partial Solutions
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Proofs, Codes, and Polynomial-Time Reducibilities
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Concatenated codes can achieve list-decoding capacity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
List decoding and property testing of error-correcting codes
List decoding and property testing of error-correcting codes
Limits to List Decoding Random Codes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Better binary list decodable codes via multilevel concatenation
IEEE Transactions on Information Theory
On the list-decodability of random linear codes
Proceedings of the forty-second ACM symposium on Theory of computing
Data stream algorithms for codeword testing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Hardness of approximating the minimum distance of a linear code
IEEE Transactions on Information Theory
List decoding from erasures: bounds and code constructions
IEEE Transactions on Information Theory
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
IEEE Transactions on Information Theory
Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We prove the following results concerning the list decoding of error-correcting codes: 1. We show that for any code with a relative distance of δ (over a large enough alphabet), the following result holds for random errors: With high probability, for a ρ ≤ δ - ε fraction of random errors (for any ε 0), the received word will have only the transmitted codeword in a Hamming ball of radius ρ around it. Thus, for random errors, one can correct twice the number of errors uniquely correctable from worst-case errors for any code. A variant of our result also gives a simple algorithm to decode Reed-Solomon codes from random errors that, to the best of our knowledge, runs faster than known algorithms for certain ranges of parameters. 2. We show that concatenated codes can achieve the list decoding capacity for erasures. A similar result for worst-case errors was proven by Guruswami and Rudra (SODA 08), although their result does not directly imply our result. Our results show that a subset of the random ensemble of codes considered by Guruswami and Rudra also achieve the list decoding capacity for erasures. We also show that the exponential list size bound in our result with outer random linear codes cannot be improved using the recent techniques of Guruswami, Håstad and Kopparty that achieved similar improvements for errors. Our proofs employ simple counting and probabilistic arguments.