Improved decoding of affine-variety codes

DOI10.1016/J.JPAA.2012.01.002zbMath1262.94027arXiv1102.4186OpenAlexW2108793748MaRDI QIDQ714109

Emmanuela Orsini, Massimiliano Sala, Chiara Marcolla

Publication date: 19 October 2012

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

Full work available at URL: https://arxiv.org/abs/1102.4186

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items (6)

On the evaluation codes given by simple \(\delta \)-sequences ⋮ Minimum-weight codewords of the Hermitian codes are supported on complete intersections ⋮ On the small-weight codewords of some Hermitian codes ⋮ Hilbert quasi-polynomial for order domains and application to coding theory ⋮ Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement ⋮ Hermitian codes and complete intersections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correcting errors and erasures via the syndrome variety
• Generic interpolation polynomial for list decoding
• 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
• Decoding affine variety codes using Gröbner bases
• On the decoding of cyclic codes using Gröbner bases
• On codes from norm-trace curves
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
• An improvement of the Feng-Rao bound on minimum distance
• Finding BCH error locator polynomials in one step
• 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>
• Gröbner Technology
• The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
• Decoding Cyclic Codes: the Cooper Philosophy
• FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
• Algebraic Decoding of a Class of Binary Cyclic Codes Via Lagrange Interpolation Formula
• Solving systems of algebraic equations by using gröbner bases
• Properties of Gröbner bases under specializations
• Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy

This page was built for publication: Improved decoding of affine-variety codes