On the BCJR trellis for linear block codes
From MaRDI portal
Publication:4885710
Recommendations
- On the trellis complexity of certain binary linear block codes
- scientific article; zbMATH DE number 1181550
- On the trellis structure of block codes
- On complexity of trellis structure of linear block codes
- The BCJR trellis and trellis decoders for some BCH codes
- scientific article; zbMATH DE number 1135091
- Bounds on the trellis size of linear block codes
- Bounds on complexity of trellis decoding of linear block codes
- Trellis decoding complexity of linear block codes
- scientific article; zbMATH DE number 1106311
Cited in
(9)- Matrix theory for minimal trellises
- Computation of distributions and their moments in the trellis
- On viewing block codes as finite automata.
- Generalized punctured convolutional codes with unequal error protection
- The BCJR trellis and trellis decoders for some BCH codes
- On maximum length convolutional codes under a trellis complexity constraint
- On Viterbi-like algorithms and their application to Reed-Muller codes
- On trellis structures for Reed-Muller codes
- On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code
This page was built for publication: On the BCJR trellis for linear block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885710)