Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24)

DOI10.1080/00207219008921158zbMath0702.94017OpenAlexW2038620990MaRDI QIDQ3481647

S. Gravano

Publication date: 1990

Published in: International Journal of Electronics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207219008921158

zbMATH Keywords

decoding algorithmextension fieldcubic error-locator polynomialtriple-error-correcting (15,5) binary BCH code

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Cyclic codes (94B15)

Cites Work

• Unnamed Item
• Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
• Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
• On the solution of algebraic equations over finite fields

This page was built for publication: Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(2⁴)