List decoding of Hermitian codes using Gröbner bases
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1104924 (Why is no real title available?)
- scientific article; zbMATH DE number 1974618 (Why is no real title available?)
- scientific article; zbMATH DE number 2081134 (Why is no real title available?)
- scientific article; zbMATH DE number 1488179 (Why is no real title available?)
- scientific article; zbMATH DE number 1504671 (Why is no real title available?)
- scientific article; zbMATH DE number 3288410 (Why is no real title available?)
- A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
- Algebraic function fields and codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- List decoding of algebraic-geometric codes
- On Koetter's algorithm and the computation of error values
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
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis
- Gröbner basis approach to list decoding of algebraic geometry codes
- 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
- Power decoding Reed-Solomon codes up to the Johnson radius
- scientific article; zbMATH DE number 1504671 (Why is no real title available?)
- 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)