Correcting errors and erasures via the syndrome variety
From MaRDI portal
(Redirected from Publication:557068)
Recommendations
- On error correction with errors in both the channel and syndrome
- Correcting a specified set of likely error patterns
- scientific article; zbMATH DE number 1693483
- Rational error correction
- Correction of ordinary and localized errors
- Error invariants
- scientific article; zbMATH DE number 4128260
- Correcting dependent errors in sequences generated by finite-state processes
Cites work
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Gröbner bases and distance of cyclic codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1243360 (Why is no real title available?)
- scientific article; zbMATH DE number 691462 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- Irreducible decomposition of polynomial ideals
- Long BCH codes are bad
- On decoding BCH codes
- On repeated-root cyclic codes
- On the decoding of cyclic codes using Gröbner bases
- On the Gröbner bases of some symmetric systems and their application to coding theory.
- On the key equation
- Repeated-root cyclic codes
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
Cited in
(11)- A commutative algebra approach to linear codes
- Degröbnerization: a political manifesto
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- scientific article; zbMATH DE number 7180108 (Why is no real title available?)
- Towards a Gröbner-free approach to coding
- On the decoding of the \((24, 12, 8)\) Golay code
- A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium
- Improved decoding of affine-variety codes
- On the decoding of binary cyclic codes with the Newton identities
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- HELP: a sparse error locator polynomial for BCH codes
This page was built for publication: Correcting errors and erasures via the syndrome variety
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557068)