Bounded distance decoding of linear error-correcting codes with Gröbner bases

DOI10.1016/j.jsc.2007.12.003zbMath1174.94031OpenAlexW1991995953MaRDI QIDQ733503

Stanislav Bulygin, Pellikaan, Ruud

Publication date: 16 October 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.12.003

zbMATH Keywords

Gröbner basislinear codedecodingminimum distancesystem of polynomial equationssyndrome decoding

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Decoding (94B35)

Related Items (3)

Error-correction of linear codes via colon ideals ⋮ Improved decoding of affine-variety codes ⋮ Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

Uses Software

• GAP
• SINGULAR
• McEliece
• GUAVA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correcting errors and erasures via the syndrome variety
• Algebra I. Basic notions of algebra. Transl. from the Russian by M. Reid
• Gröbner bases and combinatorics for binary codes
• A commutative algebra approach to linear codes
• Determinantal rings
• Finding irreducible and primitive polynomials
• Decoding affine variety codes using Gröbner bases
• On the decoding of cyclic codes using Gröbner bases
• Gröbner bases and Stanley decompositions of determinantal ideals
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
• Finding BCH error locator polynomials in one step
• The hardness of decoding linear codes with preprocessing
• On a Gröbner bases structure associated to linear codes
• Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases
• Studying the locator polynomials of minimum weight codewords of BCH codes
• A method for solving key equation for decoding goppa codes
• Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
• Decoding the ternary Golay code
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
• General principles for the algebraic decoding of cyclic codes
• Linear Sections of Determinantal Varieties
• A Class of Error-Correcting Codes in $p^m $ Symbols
• Shift-register synthesis and BCH decoding
• Encoding and error-correction procedures for the Bose-Chaudhuri codes
• Decoding beyond the BCH bound (Corresp.)
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

This page was built for publication: Bounded distance decoding of linear error-correcting codes with Gröbner bases