Finding BCH error locator polynomials in one step

DOI10.1049/el:19911294zbMath0734.94025OpenAlexW1986275363MaRDI QIDQ3363243

A. Brinton Cooper III

Publication date: 1991

Published in: Electronics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1049/el:19911294

zbMATH Keywords

error locator polynomialsBCH decodesyndrome polynomials

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (7)

An odd kind of BCH code ⋮ Towards a Gröbner-free approach to coding ⋮ 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

• Groebner

This page was built for publication: Finding BCH error locator polynomials in one step