Finding BCH error locator polynomials in one step

DOI10.1049/EL:19911294zbMATH Open0734.94025OpenAlexW1986275363MaRDI QIDQ3363243FDOQ3363243

Authors: 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

Recommendations

• Decoding beyond the BCH bound (Corresp.)
• Simple algorithms for BCH decoding
• A simple decoding of BCH codes over GF\((2^m)\)
• scientific article; zbMATH DE number 4095379
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders

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)

Cited In (9)

• Classification of error locator polynomials for double error correcting BCH codes
• Decoding beyond the BCH bound (Corresp.)
• Towards a Gröbner-free approach to coding
• On the decoding of binary cyclic codes with the Newton identities
• HELP: a sparse error locator polynomial for BCH codes
• Improved decoding of affine-variety codes
• Degröbnerization: a political manifesto
• An odd kind of BCH code
• Bounded distance decoding of linear error-correcting codes with Gröbner bases

Uses Software

• Groebner

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3363243)