On the trellis complexity of certain binary linear block codes
- 1 March 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (2) , 559-560
- https://doi.org/10.1109/18.370172
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Asymptotically good codes have infinite trellis complexityIEEE Transactions on Information Theory, 1995
- Maximum-likelihood soft decision decoding of BCH codesIEEE Transactions on Information Theory, 1994
- Dimension/length profiles and trellis complexity of linear block codesIEEE Transactions on Information Theory, 1994
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codesIEEE Transactions on Information Theory, 1993
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Minimal trellises for block codesIEEE Transactions on Information Theory, 1988
- The smallest length of binary 7–dimensional linear codes with prescribed minimum distanceDiscrete Mathematics, 1981
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978