Linear Tail-Biting Trellis and Its Sectionalization

• Published in: Journal of Information Science and Engineering Vol. 33; no. 2; pp. 571 - 581
• Main Authors: 刘亚丽(YA-LI LIU), 袁晨(CHEN YUAN)
• Format: Journal Article
• Language: English
• Published: 社團法人中華民國計算語言學學會 01.03.2017
• Subjects: information security; coding; cryptography; trellis; sectionalizatio
• ISSN: 1016-2364
• DOI: 10.6688/JISE.2017.33.2.16

In this paper, we discuss the sectionalization in linear tail-biting trellis. In [3], Lafourcade and Vardy investigated the basic property of sectionalization in conventional trellis. Their proofs of basic properties are based on conventional trellis structure which fails to be generalized to linear tail-biting trellis. We derive our proofs from the construction of Koetter-Vardy (KV) trellis in [1]. All properties of sectionalization in conventional trellis are preserved in linear tail-biting trellis. Especially, we prove the necessary condition of an optimal sectionalization in linear tail-biting trellis.