Title :
Bounds on list decoding of MDS codes
Author :
Justesen, Jørn ; Hoholdt, T.
Author_Institution :
Dept. of Telecommun., Tech. Univ. Denmark, Lyngby, Denmark
fDate :
5/1/2001 12:00:00 AM
Abstract :
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
Keywords :
Reed-Solomon codes; decoding; error correction codes; MDS codes; RS codes; Reed-Solomon codes; error correction; large alphabets; list decoding; maximum-distance separable codes; randomly chosen codes; upper bounds; worst case codeword configurations; Decoding; Error correction; Error correction codes; Joining processes; Linear code; Mathematics; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
