Upper bounds on the list-decoding radius of Reed-Solomon codes
G. Ruckenstein, Ron M. Roth · 2002
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.