Correcting errors and erasures via the syndrome variety

DOI10.1016/j.jpaa.2004.12.027zbMath1159.94397OpenAlexW2034436218MaRDI QIDQ557068

Emmanuela Orsini, Massimiliano Sala

Publication date: 23 June 2005

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpaa.2004.12.027

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

Related Items (9)

On the decoding of the \((24, 12, 8)\) Golay code ⋮ Towards a Gröbner-free approach to coding ⋮ GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES ⋮ 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 ⋮ A commutative algebra approach to linear codes ⋮ HELP: a sparse error locator polynomial for BCH codes ⋮ Degröbnerization: a political manifesto

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• 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.
• Gröbner bases and distance of cyclic codes
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
• Irreducible decomposition of polynomial ideals
• General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
• On the key equation
• On decoding BCH codes
• Long BCH codes are bad
• On repeated-root cyclic codes
• Repeated-root cyclic codes

This page was built for publication: Correcting errors and erasures via the syndrome variety