Finding BCH error locator polynomials in one step
From MaRDI portal
Publication:3363243
DOI10.1049/el:19911294zbMath0734.94025MaRDI QIDQ3363243
Publication date: 1991
Published in: Electronics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1049/el:19911294
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
Related Items
An odd kind of BCH code, 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
Uses Software