Decoding affine variety codes using Gröbner bases
For an ideal \(I\) of the polynomial ring \(F=F_q[x_1,\dots, x_s]\) over the finite field \(F_q\) with \(q\) elements, let \(I_q\) denote the ideal generated by \(I\) and the polynomials \(x_i^q-x_i\) for all \(i\), and let \(V(I_q) \subseteq F_q^s\) be the affine variety corresponding to \(I_q\). There is defined a canonical mapping \(\phi\) on the factor ring \(R=F/I_q\) to \(F_q^{V(I_q)}\), essentially defined by evaluating a polynomial at the points of the variety. For an \(F_q\)-subspace \(L\) of \(R\), the image \(\phi(L)\) is called the affine variety code corresponding to \(I\) and \(L\). The authors demonstrate that, at least theoretically, one can use the theory of Gröbner bases and elimination theory for decoding affine variety codes up to half the true minimum distance: information on error locators and error values are obtained by inspecting the reduced Gröbner basis of a certain ideal corresponding to \(I_q\) and \(L\) with respect to some lexicographic term order. The authors mention that, due to massive computations, in practice, their (very general) approach might only work for codes over small fields with restricted length. As an example, a Hermitian code with minimum distance \(5\) is considered.
- A commutative algebra approach to linear codes
- On codes from norm-trace curves
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- On evaluation codes coming from a tower of function fields
- On affine variety codes from the Klein quartic
- Vanishing ideals of projective spaces over finite fields and a projective footprint bound
- Hilbert quasi-polynomial for order domains and application to coding theory
- Affine variety codes over a hyperelliptic curve
- From primary to dual affine variety codes over the Klein quartic
- Relative generalized Hamming weights of affine Cartesian codes
- New stabilizer codes from the construction of dual-containing matrix-product codes
- Optimal codes as Tanner codes with cyclic component codes
- An improvement of the Feng-Rao bound for primary codes
- Quantum codes from affine variety codes and their subfield-subcodes
- On parameters of subfield subcodes of extended norm-trace codes
- Projective nested Cartesian codes
- Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve
- Affine Cartesian codes with complementary duals
- On the subfield subcodes of Hermitian codes
- Feng-Rao decoding of primary codes
- On the second Hamming weight of some Reed-Muller type codes
- An improvement of the Feng-Rao bound on minimum distance
- On the evaluation codes given by simple \(\delta \)-sequences
- Construction of new quantum codes via Hermitian dual-containing matrix-product codes
- Gröbner bases methods in coding theory
- Near weights on higher dimensional varieties
- Further improvements on the Feng-Rao bound for dual codes
- On the small-weight codewords of some Hermitian codes
- A decoding algorithm for binary linear codes using Groebner bases
- scientific article; zbMATH DE number 2222667 (Why is no real title available?)
- A family of codes with variable locality and availability
- Minimal codewords in norm-trace codes
- On generalized monomial codes defined over sets with a special vanishing ideal
- Decreasing norm-trace codes
- Generic interpolation polynomial for list decoding
- Considerate ramp secret sharing
- Next-to-minimal weight of toric codes defined over hypersimplices
- Improved decoding of affine-variety codes
- On the next-to-minimal weight of affine Cartesian codes
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- New quantum codes from evaluation and matrix-product codes
- High dimensional affine codes whose square has a designed minimum distance
- On puncturing of codes from norm-trace curves
This page was built for publication: Decoding affine variety codes using Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378880)
