A Caltech Library Service

Trellis-Canonical Generator Matrices for Convolutional Codes

Lin, Wei and McEliece, Robert J. and Xu, Meina (1997) Trellis-Canonical Generator Matrices for Convolutional Codes. In: 1997 IEEE International Symposium on Information Theory, Proceedings. IEEE , Piscataway, N.J., p. 286. ISBN 0-7803-3956-8.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


It was asserted in without proof, that a canonical generator matrix G(D) is trellis-canonical if and only if G(D) has the property that the span-length of the corresponding scalar matrix “G¯” cannot be reduced by a row operation of the form Row[m]= Row[n]D^s + Row[m], where s is an integer in the range 0⩽s⩽L and m ≠ n. In this paper, we prove a stronger result, viz., a basic PGM is trellis-canonical if and only if it is “row-reduced”. An efficient algorithm for converting a basic PGM into a trellis-canonical PGM is presented. We also correct an error in the general algorithm given in [3].

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1997 IEEE. Date of Current Version: 06 August 2002. This work was partially supported by NSF grant no. NCR-9505975 and a grant from Pacific Bell.
Funding AgencyGrant Number
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number5848779
Record Number:CaltechAUTHORS:20120120-100255991
Persistent URL:
Official Citation:Wei Lin; McEliece, R.J.; Meina Xu; , "Trellis-canonical generator matrices for convolutional codes," Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on , vol., no., pp.286, 29 Jun-4 Jul 1997 doi: 10.1109/ISIT.1997.613207 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:28883
Deposited By: Ruth Sustaita
Deposited On:20 Jan 2012 18:49
Last Modified:09 Nov 2021 17:01

Repository Staff Only: item control page