论文信息 - Decoding Reed-Solomon Codes Beyond Half the Minimum Distance

Decoding Reed-Solomon Codes Beyond Half the Minimum Distance

We describe an efficient implementation of M. Sudan's al gorithm for decoding Reed-Solomon codes beyond half the minimum distance. Furthermore, we calculate an upper bound of the probability of getting more than one codeword as output.

Tom Høholdt | R. R. Nielsen | T. Høholdt | R. Refslund Nielsen

[1] Shuhong Gao,et al. Computing Roots of Polynomials over Function Fields of Curves , 1999 .

[2] Keith O. Geddes,et al. Algorithms for computer algebra , 1992 .

[3] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[4] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[5] Gui Liang Feng,et al. A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.

[6] R. Blahut. Theory and practice of error control codes , 1983 .

[7] Tom Høholdt,et al. Bounds on list decoding of MDS codes , 2001, IEEE Trans. Inf. Theory.