Minimal Tail-Biting Trellises for Linear MIX Codes over $F_{p^m}$

Rajan, Sundar B and Viswanath, G (2000) Minimal Tail-Biting Trellises for Linear MIX Codes over $F_{p^m}$. In: IEEE International Symposium on Information Theory, 2000. ISIT 2000, 25-30 June, Sorrento,Italy, p. 118.

Preview

PDF minimal.pdf Download (117kB)

Abstract

For all linear (n,k,d) MDS codes over finite fields $F_{p^m}$ we identity a generator matrix with the property that the product of trellises of rows of the generator matrix will give a minimal tail-biting linear trellis, and viewing the code as a group code, identify a set of generators, the product of whose trellises will give a minimal tail biting group trellis. We also give the necessary and sufficient condition for the existence of flat minimal linear and group tail-biting trellises.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	27 Feb 2006
Last Modified:	19 Sep 2010 04:24
URI:	http://eprints.iisc.ac.in/id/eprint/5720

Actions (login required)

View Item