A table of state complexity bounds for binary linear codes
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (6) , 2034-2042
- https://doi.org/10.1109/18.556700
Abstract
This article contains a table of bounds on the state complexity of binary linear codes with length smaller than 25. General results on the state complexity of binary linear codes with low dimension or low minimum distance are includedKeywords
This publication has 13 references indexed in Scilit:
- The Trellis Complexity of Equivalent Binary [17, 9] Quadratic Residue Codes is FivePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Asymptotically good codes have infinite trellis complexityIEEE Transactions on Information Theory, 1995
- On the trellis complexity of certain binary linear block codesIEEE 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
- Generalized Hamming weights for linear codesIEEE Transactions on Information Theory, 1991
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Minimal trellises for block codesIEEE Transactions on Information Theory, 1988
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer boundInformation and Control, 1980
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978