The Internet Archive has a preservation copy of this work in our general collections.
The file type is
In this paper, a new approach for decoding low-rate Reed-Solomon codes beyond half the minimum distance is considered and analyzed. Unlike the Sudan algorithm published in 1997, this new approach is based on multi-sequence shift-register synthesis, which makes it easy to understand and simple to implement. The computational complexity of this shift-register based algorithm is of the same order as the complexity of the well-known Berlekamp-Massey algorithm. Moreover, the error correcting radiusarXiv:cs/0702130v1 fatcat:ok3nz2ufbvgsjjdgbivpjtfzt4