List decoding of Hermitian codes using Gröbner bases
From MaRDI portal
Publication:733508
DOI10.1016/J.JSC.2007.12.004zbMATH Open1281.94098arXivcs/0610132OpenAlexW1976575672MaRDI QIDQ733508FDOQ733508
Authors: Kwankyu Lee, Michael E. O'Sullivan 
Publication date: 16 October 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Abstract: List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm seems comparable to previously known algorithms achieving the same task, and the algorithm is better suited for hardware implementation.
Full work available at URL: https://arxiv.org/abs/cs/0610132
Recommendations
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Decoding (94B35)
Cites Work
- Title not available (Why is that?)
- List decoding of algebraic-geometric codes
- Algebraic function fields and codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
- A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
- Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
- Title not available (Why is that?)
- On Koetter's algorithm and the computation of error values
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Syndrome decoding for Hermite codes with a Sugiyama-type algorithm
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Generic interpolation polynomial for list decoding
- Gröbner basis approach to list decoding of algebraic geometry codes
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis
- Hermitian codes as generalized Reed-Solomon codes
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Hermitian codes and complete intersections
- On the geometry of Hermitian one-point codes
- Improved power decoding of interleaved one-point Hermitian codes
- Title not available (Why is that?)
- Power decoding Reed-Solomon codes up to the Johnson radius
- Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
This page was built for publication: List decoding of Hermitian codes using Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733508)
