List decoding of Reed-Solomon codes from a Gröbner basis perspective

From MaRDI portal




Abstract: 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 Groebner bases of modules. In a special case, this algorithm reduces to a simple Berlekamp-Massey-like decoding algorithm.




Cited in
(30)






This page was built for publication: List decoding of Reed-Solomon codes from a Gröbner basis perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931140)