Linear Tail-Biting Trellis and Its Sectionalization

被引:0
|
作者
Liu, Ya-Li [1 ]
Yuan, Chen [2 ]
机构
[1] Jiangsu Normal Univ, Coll Comp Sci & Technol, Xuzhou 221116, Peoples R China
[2] Nanyang Technol Univ, Sch Phys & Math Sci, Singapore 639798, Singapore
基金
中国国家自然科学基金;
关键词
information security; coding; cryptography; trellis; sectionalization;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:571 / 581
页数:11
相关论文
共 50 条