On the decoding of cyclic codes using Gröbner bases
The authors revisit an algorithm due to Chen, Reed, Helleseth and Truong for decoding cyclic codes up to their true minimum distance using Gröbner basis techniques. They present an algorithm based on these ideas for decoding cyclic codes. They show how to compute a Gröbner basis for the syndrome ideal using an adaption of an algorithm of Faugére, Ginanni, Lazard and Mora. In this way they obtain a more efficient decoding algorithm. As an application of their algorithm the authors present the reduced Gröbner basis for the syndrome ideal of the [23,12,7] Golay code, and a decoding algorithm.
- Description of minimum weight codewords of cyclic codes by algebraic systems
- On the Gröbner bases of some symmetric systems and their application to coding theory.
- Gröbner bases and distance of cyclic codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Sparse FGLM algorithms
- Gröbner basis for norm-trace codes
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- Degröbnerization: a political manifesto
- Algebraic structure of the minimal support codewords set of some linear codes
- Information sets in abelian codes: defining sets and Groebner basis
- Algebraic description and construction of error-correcting codes: a linear systems point of view
- Decoding cyclic codes by using Dixon resultant method
- Decoding and finding the minimum distance with Gröbner bases: history and new insights
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- Decoding cyclic codes: the Cooper philosophy
- Canonical representation of quasicyclic codes using Gröbner bases theory
- About the nth-root codes: a Gröbner basis approach to the weight computation
- Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
- scientific article; zbMATH DE number 3965972 (Why is no real title available?)
- scientific article; zbMATH DE number 1276822 (Why is no real title available?)
- scientific article; zbMATH DE number 691462 (Why is no real title available?)
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
- General principles for the algebraic decoding of cyclic codes
- scientific article; zbMATH DE number 1504687 (Why is no real title available?)
- scientific article; zbMATH DE number 953227 (Why is no real title available?)
- Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes
- A code decomposition approach for decoding cyclic and algebraic-geometric codes
- Guruswami-Sudan Decoding of Elliptic Codes Through Module Basis Reduction
- A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes
- Zech tableaux as tools for sparse decoding
- A decoding algorithm for binary linear codes using Groebner bases
- Correcting errors and erasures via the syndrome variety
- Gröbner bases over Galois rings with an application to decoding alternant codes
- Towards a Gröbner-free approach to coding
- Improved decoding of affine-variety codes
- On the decoding of binary cyclic codes with the Newton identities
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- HELP: a sparse error locator polynomial for BCH codes
- Gröbner bases and combinatorics for binary codes
This page was built for publication: On the decoding of cyclic codes using Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392662)
