The state complexity of trellis diagrams for a class of generalized concatenated codes

Author

Fujiwara, Toru ; Kasami, Tadao ; Morelos-Zaragoza, Robert ; Lin, Shu

Author_Institution

Fac. of Eng. Sci., Osaka Univ., Japan

fYear

1994

fDate

27 Jun-1 Jul 1994

Firstpage

471

Abstract

We discuss the state complexity of trellis diagrams for a class of generalized concatenated codes. The maximum number of states in the 64-section minimal trellis diagram for all the extended BCH codes of length 64 which are permuted by using the bases shown previously by Kasami et al. (1993), are the same as those obtained by Vardy and Be´ery (1993), where bit orderings were found by using DS structure and computer search. We construct several decomposable codes for which a multistage decoding up to the minimum distance can be employed. The dimensions of constructed codes are 47, 43 and 24 for length 63, and 52 and 32 for length 72. We also construct codes of length 64 as shortened codes of the codes with length 72

Keywords

BCH codes; concatenated codes; cyclic codes; trellis codes; DS structure; EG codes; bit orderings; computer search; constructed codes; cyclic codes; decomposable codes; extended BCH codes; generalized concatenated codes; multistage decoding; state complexity; trellis diagrams; Chromium; Concatenated codes; Decoding; Genetic mutations; Hamming distance; Information science; Linear code; NASA;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Conference_Location

Trondheim

Print_ISBN

0-7803-2015-8

Type

conf

DOI

10.1109/ISIT.1994.395086

Filename

395086