The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
From MaRDI portal
Publication:1871799
DOI10.1007/s002000200097zbMath1016.94039OpenAlexW2092211333MaRDI QIDQ1871799
Massimo Caboara, Ferdinando Mora
Publication date: 4 May 2003
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000200097
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cyclic codes (94B15) Decoding (94B35)
Related Items (10)
Towards a Gröbner-free approach to coding ⋮ On the Gröbner bases of some symmetric systems and their application to coding theory. ⋮ Correcting errors and erasures via the syndrome variety ⋮ 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
This page was built for publication: The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
