DocumentCode :
3157679
Title :
Isomorphic Constructions of Tail-Biting Trellises for Linear Block Codes
Author :
Zhou, Jianqin ; Ohtsuki, Tomoaki
Author_Institution :
Anhui Univ. of Technol., Maanshan
fYear :
2007
fDate :
22-24 Aug. 2007
Firstpage :
585
Lastpage :
589
Abstract :
In this paper, a new approach of constructing tail- biting 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; linear codes; trellis codes; Bahl-Cocke-Jelinek-Raviv constructed conventional trellises; isomorphic subgraphs; linear block codes; tail-biting trellises; Block codes; Computer science; Labeling; Polynomials; Time measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1009-5
Electronic_ISBN :
978-1-4244-1009-5
Type :
conf
DOI :
10.1109/CHINACOM.2007.4469459
Filename :
4469459
Link To Document :
بازگشت