Low state complexity block codes via convolutional codes

Author

Bocharova, Irina E. ; Johannesson, Rolf ; Kudryashov, Boris D.

Author_Institution

Dept. of Inf. Syst., St. Petersburg Univ. of Aerosp. Instrum., Russia

Volume

50

Issue

9

fYear

2004

Firstpage

2022

Lastpage

2030

Abstract

A new class of block codes with low state complexity of their conventional trellis representations called double zero-tail terminated convolutional codes (DZT codes) is introduced. It is shown that there exist DZT-codes meeting the Varshamov-Gilbert bound on the minimum distance and having asymptotically optimal state complexity. Two ways of constructing DZT-codes are considered. Examples of DZT-codes meeting a lower bound on the state complexity are given.

Keywords

block codes; computational complexity; convolutional codes; Varshamov-Gilbert bound; asymptotically optimal state complexity; convolutional codes; double zero-tail terminated convolutional codes; low state complexity block codes; tail-biting trellis; Aerospace electronics; Aerospace materials; Block codes; Concatenated codes; Convolutional codes; Councils; Information systems; Information theory; Linear code; Maximum likelihood decoding; Block codes; DZT codes; TB; conventional trellis; double zero-tail terminated convolutional codes; minimal trellis; tailbiting; trellis;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2004.833342

Filename

1327803