Sudan’s List Decoding of Reed-Solomon Codes from a Gröbner Basis Perspective
نویسندگان
چکیده
The interpolation step of Sudan’s list decoding of Reed-Solomon codes sets forth the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm is shown to be equivalent with the Berlekamp-Massey algorithm for decoding Reed-Solomon codes.
منابع مشابه
List decoding of Reed-Solomon codes from a Gröbner basis perspective
The interpolation step of Guruswami and Sudan’s list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm reduces to a simple Berlekamp-Massey-like decoding algorithm.
متن کاملAspects of List-of-Two Decoding
We study the problem of list decoding with focus on the case when we have a list size limited to two. Under this restriction we derive general lower bounds on the maximum possible size of a list-of-2-decodable code. We study the set of correctable error patterns in an attempt to obtain a characterization. For a special family of Reed-Solomon codes—which we identify and name class-I codes—we giv...
متن کاملAn Interpolation Algorithm for List Decoding of Reed-Solomon Codes
The interpolation step of Sudan’s list decoding of Reed-Solomon codes sets forth the problem of finding the minimal polynomial of the ideal of interpolating polynomials with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm is shown to be equivalent with the Berlekam...
متن کاملUnambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance
The Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We adapt this result to the case of Generalized Reed– Solomon codes and calculate the parameters of the corresponding Interleaved Generalized Reed–Solomon code. Fu...
متن کاملInterpolation-based Decoding of Alternant Codes
We formulate the classical decoding algorithm of alternant codes afresh based on interpolation as in Sudan’s list decoding of Reed-Solomon codes, and thus get rid of the key equation and the linear recurring sequences in the theory. The result is a streamlined exposition of the decoding algorithm using a bit of the theory of Gröbner bases of modules.
متن کامل