Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Abstract: General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding techniques for affine-variety codes using some multidimensional extensions of general error locator polynomials. We prove the existence of such polynomials for any correctable affine-variety code and hence for any linear code. We propose two main different approaches, that depend on the underlying geometry. We compute some interesting cases, including Hermitian codes. To prove our coding theory results, we develop a theory for special classes of zero-dimensional ideals, that can be considered generalizations of stratified ideals. Our improvement with respect to stratified ideals is twofold: we generalize from one variable to many variables and we introduce points with multiplicities.
Recommendations
- Decoding affine variety codes using Gröbner bases
- Correcting errors and erasures via the syndrome variety
- A code decomposition approach for decoding cyclic and algebraic-geometric codes
- Heuristic decoding of linear codes using commutative algebra
- General principles for the algebraic decoding of cyclic codes
Cites work
- scientific article; zbMATH DE number 3876580 (Why is no real title available?)
- scientific article; zbMATH DE number 691462 (Why is no real title available?)
- scientific article; zbMATH DE number 2166957 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- A commutative algebra approach to linear codes
- Algebraic Decoding of a Class of Binary Cyclic Codes Via Lagrange Interpolation Formula
- An improvement of the Feng-Rao bound on minimum distance
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- Correcting errors and erasures via the syndrome variety
- Decoding affine variety codes using Gröbner bases
- Decoding cyclic codes: the Cooper philosophy
- FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
- Finding BCH error locator polynomials in one step
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Generic interpolation polynomial for list decoding
- Gröbner technology
- Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy
- On codes from norm-trace curves
- On the decoding of binary cyclic codes with the Newton identities
- On the decoding of cyclic codes using Gröbner bases
- Properties of Gröbner bases under specializations
- Solving systems of algebraic equations by using Gröbner bases
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
Cited in
(6)- On the small-weight codewords of some Hermitian codes
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- Hilbert quasi-polynomial for order domains and application to coding theory
- Hermitian codes and complete intersections
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- On the evaluation codes given by simple \(\delta \)-sequences
This page was built for publication: Improved decoding of affine-variety codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714109)
