On the MacWilliams Identity for Convolutional Codes
| dc.creator | Gluesing-Luerssen, Heide | |
| dc.creator | Schneider, Gert | |
| dc.date | 2006-03-02 | |
| dc.date.accessioned | 2026-07-07T08:16:24Z | |
| dc.date.available | 2026-07-07T08:16:24Z | |
| dc.description | The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, stating that the adjacency matrix of a code fully determines the adjacency matrix of the dual code, will be formulated, and an explicit formula for the transformation will be stated. The formula involves the MacWilliams matrix known from complete weight enumerators of block codes. The conjecture will be proven for the class of convolutional codes where either the code itself or its dual does not have Forney indices bigger than one. For the general case the conjecture is backed up by many examples, and a weaker version will be established. | |
| dc.identifier | https://arxiv.org/abs/cs/0603013 | |
| dc.identifier | http://arxiv.org/abs/cs/0603013 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133765 | |
| dc.subject | Information Theory | |
| dc.subject | Optimization and Control | |
| dc.title | On the MacWilliams Identity for Convolutional Codes | |
| dc.type | text |