Abstract
Convolutional codes over rings were motivated from phase-modulated signals. Some structural properties of generator matrices of convolutional codes over rings have been studied. A condition for a convolutional code over a ring to be systematic is given and shown to be equivalent to the condition given by Massey and Mittelholzer (1989). Furthermore, the conditions of generator matrices over Z(pe) being catastrophic, basic, and minimal are considered, and the predictable degree property of polynomial generator matrices is considered.
| Original language | English |
|---|---|
| Title of host publication | [Host publication title missing] |
| Pages | 284 |
| DOIs | |
| Publication status | Published - 1997 |
| Event | IEEE International Symposium on Information Theory, 1997 - Ulm, Germany Duration: 1997 Jun 29 → 1997 Jul 4 |
Conference
| Conference | IEEE International Symposium on Information Theory, 1997 |
|---|---|
| Country/Territory | Germany |
| City | Ulm |
| Period | 1997/06/29 → 1997/07/04 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering