Decoding affine variety codes using Gröbner bases

DOI10.1023/A:1008274212057MaRDI QIDQ1378880zbMATH OpenOpenAlexWikidataFDO

Authors J. Ning

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

zbMATH Keywords

linear codeaffine varietyGröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Improved decoding of affine-variety codes
• scientific article; zbMATH DE number 2222667
• Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance

Cited in

(42)

• Bounded distance decoding of linear error-correcting codes with Gröbner bases
• Feng-Rao decoding of primary codes
• Quantum codes from affine variety codes and their subfield-subcodes
• Generic interpolation polynomial for list decoding
• On the small-weight codewords of some Hermitian codes
• Further improvements on the Feng-Rao bound for dual codes
• On affine variety codes from the Klein quartic
• Construction of new quantum codes via Hermitian dual-containing matrix-product codes
• Vanishing ideals of projective spaces over finite fields and a projective footprint bound
• From primary to dual affine variety codes over the Klein quartic
• Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
• On puncturing of codes from norm-trace curves
• A commutative algebra approach to linear codes
• Optimal codes as Tanner codes with cyclic component codes
• On evaluation codes coming from a tower of function fields
• Affine variety codes over a hyperelliptic curve
• Hilbert quasi-polynomial for order domains and application to coding theory
• On the next-to-minimal weight of affine Cartesian codes
• On codes from norm-trace curves
• On the subfield subcodes of Hermitian codes
• New quantum codes from evaluation and matrix-product codes
• Near weights on higher dimensional varieties
• An improvement of the Feng-Rao bound for primary codes
• An improvement of the Feng-Rao bound on minimum distance
• Projective nested Cartesian codes
• Gröbner bases methods in coding theory
• On the second Hamming weight of some Reed-Muller type codes
• scientific article; zbMATH DE number 2222667 (Why is no real title available?)
• On generalized monomial codes defined over sets with a special vanishing ideal
• Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
• On parameters of subfield subcodes of extended norm-trace codes
• Relative generalized Hamming weights of affine Cartesian codes
• New stabilizer codes from the construction of dual-containing matrix-product codes
• High dimensional affine codes whose square has a designed minimum distance
• A family of codes with variable locality and availability
• Affine Cartesian codes with complementary duals
• Decreasing norm-trace codes
• Improved decoding of affine-variety codes
• On the evaluation codes given by simple \(\delta \)-sequences
• Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve
• Minimal codewords in norm-trace codes
• A decoding algorithm for binary linear codes using Groebner bases

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)