Published January 1993
| Published
Book Section - Chapter
Open
The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes
- Creators
- McEliece, Robert J.
- Onyszchuk, Ivan
Abstract
In his celebrated paper on the algebraic structure of convolutional codes, Forney showed that by using the invariant-factor theorem, one can transform an arbitrary polynomial generator matrix for an (n, k) convolutional code C into a basic (and ultimately a minimal) generator matrix for C. He also showed how to find a polynomial inverse for a basic generator matrix for C, and a basic generator matrix for the dual code C^⊥. In this paper, we will discuss efficient ways to do all these things. Our main tool is the "entended invariant factor algorithm," which we introduce here.
Additional Information
© 1993 IEEE. Issue Date: 17-22 Jan 1993. The contribution of Ivan Onyszchuk, and a portion of the contribution of Robert J. McEliece, to this paper, was carried out at Caltech's Jet Propulsion Laboratory, under contract with the National Aeronautics and Space Administration. A portion of McEliece's contribution was also carried out at Caltech's Electrical Engineering department, and supported by AFOSR grant no. 91-0037.Attached Files
Published - MCEisit93.pdf
Files
MCEisit93.pdf
Files
(167.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:c0c827f58b648ed2ed44736fe6770f6c
|
167.6 kB | Preview Download |
Additional details
- Eprint ID
- 29666
- Resolver ID
- CaltechAUTHORS:20120309-122814096
- NASA
- 91-0037
- Air Force Office of Scientific Research (AFOSR)
- Created
-
2012-03-12Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field