Title :
Upper bounds on the list-decoding radius of Reed-Solomon codes
Author :
Ruckenstein, Gitit ; Roth, Ron M.
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
Abstract :
Upper bounds are presented on the number of errors that can be corrected by a list decoder of Reed-Solomon codes. A range of code parameters is identified where the list decoding algorithm of Guruswami and Sudan (see IEEE Trans. Inform. Theory, vol.45, p.1757-67, 1999) attains those bounds
Keywords :
Reed-Solomon codes; decoding; error correction codes; Reed-Solomon codes; error correction; list-decoding radius; upper bounds; Computer errors; Computer science; Decoding; Error correction codes; Galois fields; Hamming distance; Reed-Solomon codes; Sufficient conditions; Upper bound;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935948
