Maximum-likelihood soft decision decoding of BCH codes
From MaRDI portal
Recommendations
- On algebraic soft-decision decoding algorithms for BCH codes
- On maximum likelihood soft-decision decoding of binary linear codes
- The BCJR trellis and trellis decoders for some BCH codes
- Efficient maximum likelihood decoding of linear block codes using a trellis
- Soft trellis-based decoder for linear block codes
Cited in
(14)- Trellis complexity and pseudoredundancy of relative two-weight codes
- Finite projective geometries and classification of the weight hierarchies of codes. I
- Homogenization of binary linear codes and their applications
- Derivative descendants of cyclic codes and constacyclic codes
- The weight hierarchies of q-ary linear codes of dimension 4
- The BCJR trellis and trellis decoders for some BCH codes
- On the intersection of binary linear codes
- Weight hierarchies of linear codes of dimension 3
- The \(t\)-wise intersection and trellis of relative four-weight codes
- On algebraic soft-decision decoding algorithms for BCH codes
- The separation of binary relative three-weight codes and its applications
- On Viterbi-like algorithms and their application to Reed-Muller codes
- An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding
- On codes satisfying the double chain condition
This page was built for publication: Maximum-likelihood soft decision decoding of BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308800)