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.
Recommendations
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Gröbner basis approach to list decoding of algebraic geometry codes
- Generic interpolation polynomial for list decoding
- List decoding of Hermitian codes using Gröbner bases
- List decoding of algebraic-geometric codes
Cites work
- A Gröbner basis criterion for birational equivalence of affine varieties
- Algebraic function fields and codes
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Efficient list decoding of a class of algebraic-geometry codes
- Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve
- Generic interpolation polynomial for list decoding
- scientific article; zbMATH DE number 5529001 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1163443 (Why is no real title available?)
- scientific article; zbMATH DE number 2081134 (Why is no real title available?)
- scientific article; zbMATH DE number 3101854 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- List decoding of Hermitian codes using Gröbner bases
- Numerical semigroups.
- On the decoding of algebraic-geometric codes
- On the structure of order domains
Cited in
(1)
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)