Title :
Minimal Trellises for Two Classes of Linear Codes
Author :
Lan, Qinghui ; Kan, Haibin
Author_Institution :
Fudan Univ., Shanghai
Abstract :
Trellis representations of linear block codes not only illustrate code structure, but also often lead to efficient trellis-based decoding algorithms. In this paper, we try to find the minimal trellises for two important classes of linear codes, i.e., cyclic codes and quasi-cyclic codes.
Keywords :
linear codes; trellis codes; cyclic codes; linear block codes; quasi-cyclic codes; trellis representations; trellis-based decoding algorithms; Block codes; Character generation; Decoding; Galois fields; Graphics; Internet; Linear code; Parity check codes; Viterbi algorithm; Zinc; cyclic codes; minimal trellis; quasi-cyclic codes;
Conference_Titel :
Internet Computing in Science and Engineering, 2008. ICICSE '08. International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-0-7695-3112-0
Electronic_ISBN :
978-0-7695-3112-0
DOI :
10.1109/ICICSE.2008.48
