Isomorphic Constructions of Tail-Biting Trellises for Linear Block Codes

Jianqin Zhou; Tomoaki Ohtsuki

2nd International ICST Conference on Communications and Networking in China

Research Article

Isomorphic Constructions of Tail-Biting Trellises for Linear Block Codes

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2007.4469459,
    author={Jianqin Zhou and Tomoaki Ohtsuki},
    title={Isomorphic Constructions of Tail-Biting Trellises for Linear Block Codes},
    proceedings={2nd International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2008},
    month={3},
    keywords={Block codes  Computer science  Labeling  Polynomials  Time measurement},
    doi={10.1109/CHINACOM.2007.4469459}
}

Jianqin Zhou
Tomoaki Ohtsuki
Year: 2008
Isomorphic Constructions of Tail-Biting Trellises for Linear Block Codes
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469459

Jianqin Zhou¹^,*, Tomoaki Ohtsuki²^,*

1: Department of Computer Science Anhui University of Technology Ma’anshan, 243002 China
2: Department of Information and Computer Science Keio University Yokohama, 223-8522 Japan

*Contact email: zhou9@yahoo.com, ohtsuki@ics.keio.ac.jp

Abstract

In this paper, a new approach of constructing tailbiting trellises for linear block codes is presented. It is proved that any minimal tail-biting trellis can be constructed by the recursive process of uniting two isomorphic subgraphs from the well-known Bahl-Cocke-Jelinek-Raviv(BCJR) constructed conventional trellises. Furthermore, several properties of isomorphic constructions of tail-biting trellises are discussed.

Keywords: Block codes Computer science Labeling Polynomials Time measurement

Published: 2008-03-07
Publisher: IEEE
Modified: 2011-07-17

: http://dx.doi.org/10.1109/CHINACOM.2007.4469459