Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24)
From MaRDI portal
Publication:3481647
Recommendations
- A new error-locating polynomial for decoding of BCH codes (Corresp.)
- scientific article; zbMATH DE number 7720786
- Classification of error locator polynomials for double error correcting BCH codes
- scientific article; zbMATH DE number 3215708
- A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd m
- scientific article; zbMATH DE number 1559532
- On the undetected error probability of triple-error-correcting BCH codes
- Algebraic decoding of the ternary (13,7,5) quadratic residue code
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
- HELP: a sparse error locator polynomial for BCH codes
Cites work
Cited in
(9)- A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd m
- The coset weight distributions of certain BCH codes and a family of curves.
- A simple decoding of BCH codes over GF(2ᵐ)
- Classification of error locator polynomials for double error correcting BCH codes
- scientific article; zbMATH DE number 4095379 (Why is no real title available?)
- scientific article; zbMATH DE number 220143 (Why is no real title available?)
- Decoding beyond the BCH bound (Corresp.)
- Generic BCH codes. Polynomial-norm error decoding
- Using Tschirnhaus transformations to find roots in quintic polynomials over \(\mathbb{F}_{2^{m}}\)
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(24)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481647)