Trellis Complexity of Short Linear Codes

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

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2007-01, Vol.53 (1), p.361-368
Hauptverfasser:	Bocharova, I.E., Johannesson, R., Kudryashov, B.D.
Format:	Artikel
Sprache:	eng
Schlagworte:	binary codes Block codes Codes Complexity Computational complexity Concatenated codes Construction Convolutional codes Decoding double zero-tail terminated convolutional codes (DZT-codes) double zero-tail termination DZT Electrical Engineering, Electronic Engineering, Information Engineering Elektroteknik och elektronik Engineering and Technology Information theory Linear code linear codes Linear programming minimal span form minimal trellis Performance analysis short binary linear codes Shuurman's bound Tables (data) Teknik Tree data structures trellis codes trellis complexity Upper bound Upper bounds Viterbi algorithm
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2006.887522