Trellis decoding complexity of linear block codes
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (6) , 1687-1697
- https://doi.org/10.1109/18.556665
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On the Construction and Dimensionality of Linear Block Code TrellisesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Asymptotically good codes have infinite trellis complexityIEEE Transactions on Information Theory, 1995
- Lower bounds on trellis complexity of block codesIEEE Transactions on Information Theory, 1995
- On the trellis structure of block codesIEEE Transactions on Information Theory, 1995
- On complexity of trellis structure of linear block codesIEEE Transactions on Information Theory, 1993
- Minimum support weights of binary codesIEEE Transactions on Information Theory, 1993
- On the generalized Hamming weights of product codesIEEE Transactions on Information Theory, 1993
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codesIEEE Transactions on Information Theory, 1993
- Support weight distribution of linear codesDiscrete Mathematics, 1992
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978