Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct

We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.

• Type: Conference
• Year: 2001
• Where: ICALP
• Authors: Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan
• Keywords: Generator Matrices, ICALP 2001, Linear Cyclic Codes, Minimal Tail-biting Trellises, Programming Languages