Decoding affine variety codes using Gröbner bases
DOI10.1023/A:1008274212057zbMATH Open0905.94027OpenAlexW2153471038WikidataQ121931226 ScholiaQ121931226MaRDI QIDQ1378880FDOQ1378880
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
Recommendations
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)
Cited In (42)
- 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
- On affine variety codes from the Klein quartic
- Further improvements on the Feng-Rao bound for dual codes
- 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
- Gröbner bases methods in coding theory
- Projective nested Cartesian codes
- Title not available (Why is that?)
- On generalized monomial codes defined over sets with a special vanishing ideal
- On the second Hamming weight of some Reed-Muller type codes
- On parameters of subfield subcodes of extended norm-trace codes
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- Relative generalized Hamming weights of affine Cartesian codes
- New stabilizer codes from the construction of dual-containing matrix-product codes
- A family of codes with variable locality and availability
- Decreasing norm-trace codes
- High dimensional affine codes whose square has a designed minimum distance
- Affine Cartesian codes with complementary duals
- Improved decoding of affine-variety codes
- On the evaluation codes given by simple \(\delta \)-sequences
- Minimal codewords in norm-trace codes
- Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve
- A decoding algorithm for binary linear codes using Groebner bases
- Feng-Rao decoding of primary codes
- Bounded distance decoding of linear error-correcting codes with Gröbner 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)
