List Decoding of Reed-Solomon Codes from a Groebner Basis Perspective

Simple item page
dc.creatorLee, Kwankyu
dc.creatorO'Sullivan, Michael E.
dc.date2006-01-02
dc.date2007-12-11
dc.date.accessioned2026-07-07T08:48:25Z
dc.date.available2026-07-07T08:48:25Z
dc.descriptionThe 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.
dc.descriptionsubmitted to the Journal of Symbolic Computation; Shortened and revised version
dc.identifierhttps://arxiv.org/abs/math/0601022
dc.identifierhttp://arxiv.org/abs/math/0601022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143939
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13P10; 68W30
dc.titleList Decoding of Reed-Solomon Codes from a Groebner Basis Perspective
dc.typetext

Files

Collections

arXiv