General principles for the algebraic decoding of cyclic codes
From MaRDI portal
Publication:4324146
DOI10.1109/18.333886zbMath0824.94026OpenAlexW1967589453MaRDI QIDQ4324146
Xuemin Chen, Tor Helleseth, Trieu-Kien Truong, Irving S. Reed
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.333886
Related Items (6)
Matrix-product structure of repeated-root cyclic codes over finite fields ⋮ Towards a Gröbner-free approach to coding ⋮ 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: General principles for the algebraic decoding of cyclic codes