Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Introduction to Coding Theory
Expander-Based Constructions of Efficiently Decodable Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Bounds on list decoding of MDS codes
IEEE Transactions on Information Theory
Combinatorial bounds for list decoding
IEEE Transactions on Information Theory
Hardness of approximating the minimum distance of a linear code
IEEE Transactions on Information Theory
Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Designs, Codes and Cryptography
Subspace polynomials and limits to list decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Parameter choices on Guruswami--Sudan algorithm for polynomial reconstruction
Finite Fields and Their Applications
Hi-index | 0.06 |
In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes.Given n distinct elements α1,...,αn from a field F, and n subsets S1,...,Sn of F each of size at most l, the list decoding algorithm of Guruswami and Sudan [7] can in polynomial time output all polynomials p of degree at most k which satisfy p(αi) ∈ Si for every i, as long as l i,∈i) ∈ F2 (the βi's need not be distinct), find and output all degree k polynomials p such that p(βi) = γi for at least $t$ values of i, provided t √k n'. By our result, an improvement to the Reed-Solomon list decoder of [7] that works with slightly smaller agreement, say t √kn' - k/2, can only be obtained by exploiting some property of the βi's (for example, their (near) distinctness).For Reed-Solomon codes of block length $n$ and dimension k where k = nδ for small enough δ, we exhibit an explicit received word r with a super-polynomial number of Reed-Solomon codewords that agree with it on $(2 - ε) k locations, for any desired ε 0 (we note agreement of k is trivial to achieve). Such a bound was known earlier only for a non-explicit center. We remark that finding explicit bad list decoding configurations is of significant interest --- for example the best known rate vs. distance trade-off is based on a bad list decoding configuration for algebraic-geometric codes [14] which is unfortunately not explicitly known.