Publikationer
Trellis complexity of short linear codes
Publiceringsår: 2007
Språk: Engelska
Sidor: 361-368
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 53
Nummer: 1
Dokumenttyp: Artikel
Förlag: IEEE
Sammanfattning
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
Disputation
Nyckelord
- Technology and Engineering
- short binary linear codes
- double zero-tail termination
- linear codes
- binary codes
- trellis codes
- DZT
- Shuurman's bound
- trellis complexity
Övrigt
Published
Yes
- ISSN: 0018-9448
