On the decoding of cyclic codes using Gröbner bases
From MaRDI portal
Publication:1392662
DOI10.1007/s002000050084zbMath0916.94013OpenAlexW2000492750MaRDI QIDQ1392662
Philippe Loustaunau, Eric Von York
Publication date: 3 June 1999
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000050084
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cyclic codes (94B15) Decoding (94B35)
Related Items (9)
Towards a Gröbner-free approach to coding ⋮ Sparse FGLM algorithms ⋮ On the Gröbner bases of some symmetric systems and their application to coding theory. ⋮ Correcting errors and erasures via the syndrome variety ⋮ 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 ⋮ Degröbnerization: a political manifesto
This page was built for publication: On the decoding of cyclic codes using Gröbner bases
