Generalization of the Lee-O'Sullivan list decoding for one-point AG codes

From MaRDI portal
(Redirected from Publication:390381)



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 page was built for publication: Generalization of the Lee-O'Sullivan list decoding for one-point AG codes

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