Minimal trellises for block codes
From MaRDI portal
Publication:3816021
DOI10.1109/18.21228zbMath0664.94019OpenAlexW2083394863MaRDI QIDQ3816021
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.21228
Related Items (7)
On viewing block codes as finite automata. ⋮ On trellis structures for Reed-Muller codes ⋮ On the relative profiles of a linear code and a subcode ⋮ Bideterministic automata and minimal representations of regular languages ⋮ Concatenated kernel codes ⋮ On maximum length convolutional codes under a trellis complexity constraint ⋮ On self-dual ternary codes and their coordinate ordering.
This page was built for publication: Minimal trellises for block codes
