A simple decoding of BCH codes over GF(2ᵐ)
From MaRDI portal
A simple decoding of BCH codes over GF\((2^m)\)
Recommendations
- Simple algorithms for BCH decoding
- On algebraic soft-decision decoding algorithms for BCH codes
- Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24)
- Decoding beyond the BCH bound (Corresp.)
- scientific article; zbMATH DE number 4095379
Cited in
(17)- An improved algorithm for Davida amd Cowles's decoding method
- A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd m
- Classification of error locator polynomials for double error correcting BCH codes
- A decoding method of an n length binary BCH code through (n+1)n length binary cyclic code
- Finding BCH error locator polynomials in one step
- Encoding and decoding of BCH codes using light and short codewords
- scientific article; zbMATH DE number 4095379 (Why is no real title available?)
- An odd kind of BCH code
- Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder
- Malfunction in the Peterson-Gorenstein-Zierler decoder
- scientific article; zbMATH DE number 1559532 (Why is no real title available?)
- Simple algorithms for BCH decoding
- Research of the BCH code decoding method based on the check matrix
- A very low cost BCH decoder for high immunity of on-chip memories
- Decoding beyond the BCH bound (Corresp.)
- An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem
- Generic BCH codes. Polynomial-norm error decoding
This page was built for publication: A simple decoding of BCH codes over GF\((2^m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714777)
