List decoding algorithm based on voting in Gröbner bases for general one-point AG codes

DOI10.1016/j.jsc.2016.02.015zbMath1409.94944arXiv1203.6127OpenAlexW2143766839WikidataQ57735010 ScholiaQ57735010MaRDI QIDQ507148

Olav Geil, Ryutaroh Matsumoto, Diego Ruano

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.6127

zbMATH Keywords

Gröbner basislist decodingalgebraic geometry code

Mathematics Subject Classification ID

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 (2)

On the evaluation codes given by simple \(\delta \)-sequences ⋮ Generalization of the Lee-O'Sullivan list decoding for one-point AG codes

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
• Distance bounds for algebraic geometric codes
• Efficient list decoding of a class of algebraic-geometry codes
• Coset bounds for algebraic geometric codes
• On the order bounds for one-point AG codes
• Generic interpolation polynomial for list decoding
• On the structure of order domains
• List decoding of Hermitian codes using Gröbner bases
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
• List decoding of Reed-Solomon codes from a Gröbner basis perspective
• Numerical semigroups.
• A Gröbner basis criterion for birational equivalence of affine varieties
• A course in error-correcting codes.
• Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• The order bound for general algebraic geometric codes
• Feng-Rao decoding of primary codes
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Evaluation codes from order domain theory
• Unique Decoding of General AG Codes
• Decoding algebraic-geometric codes up to the designed minimum distance
• Lifting standard bases in filtered structures
• An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
• List decoding of algebraic-geometric codes
• On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes
• Performance analysis of a decoding algorithm for algebraic-geometry codes
• On the decoding of algebraic-geometric codes
• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Improved geometric Goppa codes. I. Basic theory
• Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Unique Decoding of Plane AG Codes via Interpolation
• A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman

This page was built for publication: List decoding algorithm based on voting in Gröbner bases for general one-point AG codes