On algebraic soft-decision decoding algorithms for BCH codes
From MaRDI portal
Publication:4544453
Recommendations
- Generalization of chase algorithms for soft decision decoding of binary linear codes
- Maximum-likelihood soft decision decoding of BCH codes
- Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
- scientific article; zbMATH DE number 2081149
- Algebraic soft-decision decoding of reed-solomon codes
Cited in
(18)- An improved algorithm for Davida amd Cowles's decoding method
- A simple decoding of BCH codes over GF(2ᵐ)
- Generalization of chase algorithms for soft decision decoding of binary linear codes
- Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
- Encoding and decoding of BCH codes using light and short codewords
- scientific article; zbMATH DE number 45704 (Why is no real title available?)
- Maximum-likelihood soft decision decoding of BCH codes
- On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes
- On Blahut's decoding algorithms for two-dimensional BCH codes
- scientific article; zbMATH DE number 1941099 (Why is no real title available?)
- scientific article; zbMATH DE number 2081149 (Why is no real title available?)
- Reliability-based decoding erasure algorithm for BCH code in the BeiDou system
- Geometrical and performance analysis of GMD and Chase decoding algorithms
- Simple algorithms for BCH decoding
- Adaptive Viterbi decoding algorithm for the shortened (38,26) BCH code based on trellis
- A branching control circuit for Berlekamp's BCH decoding algorithm (Corresp.)
- Generic BCH codes. Polynomial-norm error decoding
- Derivative descendants of cyclic codes and constacyclic codes
This page was built for publication: On algebraic soft-decision decoding algorithms for BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544453)