A Caltech Library Service

The trellis complexity of convolutional codes

McEliece, Robert J. and Lin, Wei (1995) The trellis complexity of convolutional codes. In: Proceedings 1995 IEEE International Symposium on Information Theory. IEEE , Piscataway, N.J., p. 131. ISBN 0-7803-2453-6.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


We develop a theory of minimal trellises for convolutional codes, and find that the “standard” trellis need not be the minimal trellis. We have found a simple algorithm for finding a generator matrix for a convolutional code, for which the corresponding “scalar” generator matrix is in “minimal span” form.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1995 IEEE. Date of Current Version: 06 August 2002. This work was partially supported by a grant from Pacific Bell.
Funding AgencyGrant Number
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number5267454
Record Number:CaltechAUTHORS:20120223-102920927
Persistent URL:
Official Citation:McEliece, R.J.; Wei Lin; , "The trellis complexity of convolutional codes," Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on , vol., no., pp.131, 17-22 Sep 1995 doi: 10.1109/ISIT.1995.531335 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:29437
Deposited By: Ruth Sustaita
Deposited On:23 Feb 2012 18:52
Last Modified:09 Nov 2021 17:07

Repository Staff Only: item control page