On the MacWilliams Identity for Convolutional Codes
From MaRDI portal
Publication:3604648
Abstract: 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.
Recommendations
Cited in
(8)- On isometries for convolutional codes
- State space realizations and monomial equivalence for convolutional codes
- A MACWILLIAMS FORMULA FOR CONVOLUTIONAL CODES
- Generalized MacWilliams identities and their applications to perfect binary codes
- Dual convolutional codes and the MacWilliams identities
- On superregular matrices and MDP convolutional codes
- Über die Identität von MacWilliams für die Gewichtsfunktion von Codes
- On the weight distribution of convolutional codes
This page was built for publication: On the MacWilliams Identity for Convolutional Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604648)