Grobner basis approach to list decoding of algebraic geometry codes
We show how our Grobner basis algorithm, which was previously applied to list decoding of Reed Solomon codes, can be used in the hard and soft decision list decoding of Algebraic Geometry codes. In addition, we present a linear functional version of our Grobner basis algorithm in order to facilitate comparisons with methods based on duality.
list decoding algebraic geometry codes grobner bases polynomial modules error correcting codes