On the trellis structure of block codes
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (6) , 1924-1937
- https://doi.org/10.1109/18.476317
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- On the Construction and Dimensionality of Linear Block Code TrellisesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The Trellis Complexity of Equivalent Binary [17, 9] Quadratic Residue Codes is FivePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On the BCJR trellis for linear block codesIEEE Transactions on Information Theory, 1996
- Asymptotically good codes have infinite trellis complexityIEEE Transactions on Information Theory, 1995
- Soft trellis-based decoder for linear block codesIEEE Transactions on Information Theory, 1994
- Vector quantizers with direct sum codebooksIEEE Transactions on Information Theory, 1993
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encodersIEEE Transactions on Information Theory, 1993
- Bounds on the trellis size of linear block codesIEEE Transactions on Information Theory, 1993
- Multilevel codes and multistage decodingIEEE Transactions on Communications, 1989
- On the structure of convolutional and cyclic convolutional codesIEEE Transactions on Information Theory, 1979