Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
From MaRDI portal
Publication:390381
DOI10.1016/j.jsc.2013.03.001zbMath1380.94149arXiv1203.6129OpenAlexW1968814246MaRDI QIDQ390381
Olav Geil, Diego Ruano, Ryutaroh Matsumoto
Publication date: 8 January 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.6129
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Efficient list decoding of a class of algebraic-geometry codes
- Generic interpolation polynomial for list decoding
- Algebraic function fields and codes
- On the structure of order domains
- List decoding of Hermitian codes using Gröbner bases
- Numerical semigroups.
- A Gröbner basis criterion for birational equivalence of affine varieties
- Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- On the decoding of algebraic-geometric 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