Decoding affine variety codes using Gröbner bases
From MaRDI portal
Publication:1378880
DOI10.1023/A:1008274212057zbMath0905.94027OpenAlexW2153471038MaRDI QIDQ1378880
Publication date: 31 January 1999
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008274212057
Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items (37)
On evaluation codes coming from a tower of function fields ⋮ On the evaluation codes given by simple \(\delta \)-sequences ⋮ Near weights on higher dimensional varieties ⋮ On puncturing of codes from norm-trace curves ⋮ On parameters of subfield subcodes of extended norm-trace codes ⋮ Projective nested Cartesian codes ⋮ Relative generalized Hamming weights of affine Cartesian codes ⋮ Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve ⋮ Further improvements on the Feng-Rao bound for dual codes ⋮ Affine Cartesian codes with complementary duals ⋮ A family of codes with variable locality and availability ⋮ Minimal codewords in norm-trace codes ⋮ On codes from norm-trace curves ⋮ Construction of new quantum codes via Hermitian dual-containing matrix-product codes ⋮ On generalized monomial codes defined over sets with a special vanishing ideal ⋮ On the subfield subcodes of Hermitian codes ⋮ Feng-Rao decoding of primary codes ⋮ On the second Hamming weight of some Reed-Muller type codes ⋮ Generic interpolation polynomial for list decoding ⋮ On affine variety codes from the Klein quartic ⋮ Vanishing ideals of projective spaces over finite fields and a projective footprint bound ⋮ On the small-weight codewords of some Hermitian codes ⋮ Improved decoding of affine-variety codes ⋮ Affine variety codes over a hyperelliptic curve ⋮ An improvement of the Feng-Rao bound on minimum distance ⋮ Hilbert quasi-polynomial for order domains and application to coding theory ⋮ 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 ⋮ New stabilizer codes from the construction of dual-containing matrix-product codes ⋮ A commutative algebra approach to linear codes ⋮ High dimensional affine codes whose square has a designed minimum distance ⋮ 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 ⋮ From primary to dual affine variety codes over the Klein quartic
This page was built for publication: Decoding affine variety codes using Gröbner bases
