Minimal trellises for block codes
From MaRDI portal
Recommendations
- Minimal Trellis Modules and Equivalent Convolutional Codes
- Lower bounds on trellis complexity of block codes
- On the trellis structure of block codes
- Minimal linear codes arising from blocking sets
- Bounds on the minimum distance of trellis codes
- scientific article; zbMATH DE number 1754625
- Minimal codewords in Reed-Muller codes
- Minimum distance bounding techniques for individual trellis codes
- On the trellis complexity of certain binary linear block codes
- Minimal linear codes over finite fields
Cited in
(15)- Number of minimal-weight words in block codes
- On viewing block codes as finite automata.
- On self-dual ternary codes and their coordinate ordering.
- On maximum length convolutional codes under a trellis complexity constraint
- On trellis structures for Reed-Muller codes
- On the relative profiles of a linear code and a subcode
- The trellis structure of maximal fixed-cost codes
- Minimal trellis design for linear codes based on the Shannon product
- Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
- scientific article; zbMATH DE number 4074967 (Why is no real title available?)
- Bounds on the minimum distance of trellis codes
- scientific article; zbMATH DE number 1754625 (Why is no real title available?)
- On the trellis structure of block codes
- Concatenated kernel codes
- Bideterministic automata and minimal representations of regular languages
This page was built for publication: Minimal trellises for block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3816021)
