JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16]


Journal of Information Science and Engineering, Vol. 33 No. 2, pp. 571-581


Linear Tail-Biting Trellis and Its Sectionalization

YA-LI LIU1 AND CHEN YUAN2
1College of Computer Science and Technology
Jiangsu Normal University
Xuzhou, 221116 China
E-mail: liuyali@jsnu.edu.cn
2School of Physical and Mathematical Sciences
Nanyang Technological University
639798 Singapore

    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.     

Keywords: information security, coding, cryptography, trellis, sectionalization

  Retrieve PDF document (JISE_201702_16.pdf)