Title :
Bounds on list decoding of MDS codes
Author :
Justesen, Jorn ; Hoholdt, Tom
Author_Institution :
Dept. of Telecommun., Tech. Univ. Denmark, Lyngby, Denmark
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 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; Reed-Solomon codes; error correction; large alphabets; list decoding; maximum distance separable codes; upper bounds; worst-case codeword configurations; Decoding; Error correction; Error correction codes; Mathematics; Reed-Solomon codes; Upper bound;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866778
