On the MacWilliams Identity for Convolutional Codes
From MaRDI portal
Publication:3604648
DOI10.1109/TIT.2008.917664zbMATH Open1318.94100arXivcs/0603013MaRDI QIDQ3604648FDOQ3604648
Authors: Heide Gluesing-Luerssen, Gert Schneider 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cs/0603013
Recommendations
Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cited In (8)
- On the weight distribution of convolutional codes
- On isometries for convolutional codes
- On superregular matrices and MDP convolutional codes
- Über die Identität von MacWilliams für die Gewichtsfunktion von Codes
- Generalized MacWilliams identities and their applications to perfect binary codes
- State space realizations and monomial equivalence for convolutional codes
- A MACWILLIAMS FORMULA FOR CONVOLUTIONAL CODES
- Dual convolutional codes and the MacWilliams identities
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)
