On the trellis structure of block codes
From MaRDI portal
Recommendations
Cited in
(26)- Enumeration, construction and random generation of block codes
- On viewing block codes as finite automata.
- On Viterbi-like algorithms and their application to Reed-Muller codes
- On trellis structures for Reed-Muller codes
- The generalization of some trellis properties of linear codes to group codes
- Matrix theory for minimal trellises
- Trellis codes for periodic erasures
- The trellis structure of maximal fixed-cost codes
- On the intractability of permuting a block code to minimize trellis complexity
- Minimal trellis design for linear codes based on the Shannon product
- Structure, optimization, and realization of FFSK trellis codes
- Minimal trellises for block codes
- Bounds on the trellis size of linear block codes
- scientific article; zbMATH DE number 1284437 (Why is no real title available?)
- A trellis coded modulation scheme constructed from block coded modulation with interblock memory
- Trellis complexity of linear block codes via atomic codewords
- scientific article; zbMATH DE number 1181550 (Why is no real title available?)
- Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
- On the trellis representation of the Delsarte-Goethals codes
- Kernel code and its controllability
- On the trellis complexity of certain binary linear block codes
- On the BCJR trellis for linear block codes
- Concatenated kernel codes
- Classification of Niederreiter–Rosenbloom–Tsfasman Block Codes
- The “Art of Trellis Decoding” Is NP-Hard
- Minimal trellises for non-degenerate and degenerate decoding of quantum stabilizer codes
This page was built for publication: On the trellis structure of block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880314)
