arXiv · math/0601022
List Decoding of Reed-Solomon Codes from a Groebner Basis Perspective
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.
Explore related subjects
Keep this discovery
Kwankyu Lee, Michael E. O'Sullivan. 2007-12-11. List Decoding of Reed-Solomon Codes from a Groebner Basis Perspective. https://arxiv.org/abs/math/0601022
Cite the original work for its findings. Save a collection to share your selection of sources.