DocumentCode
896318
Title
Trellis Complexity of Short Linear Codes
Author
Bocharova, Irina E. ; Johannesson, Rolf ; Kudryashov, Boris D.
Author_Institution
Dept. of Inf. Syst., St.-Petersburg Univ. of Aerosp. Instrum., St. Petersburg
Volume
53
Issue
1
fYear
2007
Firstpage
361
Lastpage
368
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
Keywords
binary codes; linear codes; trellis codes; DZT; Shuurman´s bound; double zero-tail termination; short binary linear codes; trellis complexity; Block codes; Computational complexity; Concatenated codes; Convolutional codes; Decoding; Linear code; Performance analysis; Tree data structures; Upper bound; Viterbi algorithm; Block codes; double zero-tail terminated convolutional codes (DZT-codes); minimal span form; minimal trellis; trellis complexity;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2006.887522
Filename
4039648
Link To Document