Bounded distance decoding of linear error-correcting codes with Gröbner bases
From MaRDI portal
Publication:733503
DOI10.1016/J.JSC.2007.12.003zbMATH Open1174.94031OpenAlexW1991995953MaRDI QIDQ733503FDOQ733503
Authors: Stanislav Bulygin, Ruud Pellikaan 
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
Recommendations
- Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
- Decoding and finding the minimum distance with Gröbner bases: history and new insights
- scientific article; zbMATH DE number 1276822
- A Gröbner representation for linear codes
- A decoding algorithm for binary linear codes using Groebner bases
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Decoding (94B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decoding beyond the BCH bound (Corresp.)
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Determinantal rings
- Title not available (Why is that?)
- Decoding the ternary Golay code
- Title not available (Why is that?)
- Decoding affine variety codes using Gröbner bases
- The hardness of decoding linear codes with preprocessing
- Title not available (Why is that?)
- Gröbner bases and combinatorics for binary codes
- Title not available (Why is that?)
- On a Gröbner bases structure associated to linear codes
- Finding BCH error locator polynomials in one step
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Title not available (Why is that?)
- A method for solving key equation for decoding goppa codes
- Algebra I. Basic notions of algebra. Transl. from the Russian by M. Reid
- Gröbner bases and Stanley decompositions of determinantal ideals
- Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
- On the decoding of cyclic codes using Gröbner bases
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- Title not available (Why is that?)
- Correcting errors and erasures via the syndrome variety
- Studying the locator polynomials of minimum weight codewords of BCH codes
- A commutative algebra approach to linear codes
- Finding irreducible and primitive polynomials
- Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
- Title not available (Why is that?)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cited In (11)
- A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Title not available (Why is that?)
- An application of the FGLM techniques to linear codes
- Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- Improved decoding of affine-variety codes
- Error-correction of linear codes via colon ideals
- A decoding algorithm for binary linear codes using Groebner bases
- Decoding and finding the minimum distance with Gröbner bases: history and new insights
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
Uses Software
This page was built for publication: Bounded distance decoding of linear error-correcting codes with Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733503)
