Published September 1995
| Published
Book Section - Chapter
Open
The trellis complexity of convolutional codes
- Creators
- McEliece, Robert J.
- Lin, Wei
Abstract
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.
Additional Information
© 1995 IEEE. Date of Current Version: 06 August 2002. This work was partially supported by a grant from Pacific Bell.Attached Files
Published - MCEisit95b.pdf
Files
MCEisit95b.pdf
Files
(123.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:3cd1f9fa1178d1d8df9afa19667f5ea3
|
123.5 kB | Preview Download |
Additional details
- Eprint ID
- 29437
- Resolver ID
- CaltechAUTHORS:20120223-102920927
- Pacific Bell
- Created
-
2012-02-23Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5267454