Title :
Searching for tailbiting codes with large minimum distances
Author :
Bocharova, Irina E. ; Kudryashov, Boris D. ; Johannesson, Rolf ; Ståhl, Per
Author_Institution :
Dept. of Inf. Syst., Univ. on Airspace Instrum., St. Petersburg, Russia
Abstract :
Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. A new lower bound on the maximal state complexity of an arbitrary tailbiting code is derived. The asymptotic behavior of the derived bound is investigated. Some new tailbiting representations for linear block codes of rates R=1/c, c=2,3,4 are presented
Keywords :
binary codes; block codes; computational complexity; linear codes; trellis codes; arbitrary tailbiting code; asymptotic behavior; large minimum distance; linear block codes; lower bound; maximal state complexity; tailbiting codes; tailbiting trellis representations; Block codes; Convolutional codes; Electronic mail; Instruments; Linear code; Radio access networks; Upper bound;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866639
