Abstract
An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lower and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction
| Original language | English |
|---|---|
| Pages (from-to) | 361-368 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 53 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2007 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- short binary linear codes
- double zero-tail termination
- linear codes
- binary codes
- trellis codes
- DZT
- Shuurman's bound
- trellis complexity