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

Shankar, Priti and Kumar, PNA and Singh, Harmeet and Rajan, BS (2001) Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct. In: Automata Languages and Programming, Proceeding, 2076 . pp. 627-638.

Preview

PDF minimal_tail.pdf Download (159kB)

Abstract

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 repre-sentation in the form of a graph can be obtained by standard procedures.

Item Type:	Journal Article
Publication:	Automata Languages and Programming, Proceeding
Publisher:	Springer-Verlag
Additional Information:	Copyright for this article belongs to Springer-Verlag.
Keywords:	linear block codes;cyclic codes;Reed-Solomon codes;tail- biting trellises
Department/Centre:	Division of Mechanical Sciences > Chemical Engineering
Date Deposited:	15 Sep 2004
Last Modified:	19 Sep 2010 04:16
URI:	http://eprints.iisc.ac.in/id/eprint/1919

Actions (login required)

View Item