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.