Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes
classification
💻 cs.IT
cs.SCmath.ACmath.AGmath.IT
keywords
codesgeneralizationsullivanalgorithmdecodinglistobnerone-point
read the original abstract
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. Our generalization enables us to apply the fast algorithm to compute a Gr\"obner basis of a module proposed by Lee and O'Sullivan, which was not possible in another generalization by Lax.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.