Limits to list decodability of linear codes
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Limits to list decoding Reed-Solomon codes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Subspace polynomials and limits to list decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
We derive upper bounds on the number of errors that can be corrected by list decoding of maximum-distance separable (MDS) codes using small lists. We show that the performance of Reed-Solomon (RS) codes, for certain parameter values, is limited by worst case codeword configurations, but that with randomly chosen codes over large alphabets, more errors can be corrected