A complete MacWilliams theorem for convolutional codes

Publication Type:
Conference Proceeding
Citation:
2014 IEEE Information Theory Workshop, ITW 2014, 2014, pp. 157 - 161
Issue Date:
2014-01-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
3AB77311-4388-4820-9716-321E442713D6 am.pdfAccepted Manuscript version273.12 kB
Adobe PDF
© 2014 IEEE. In this paper, we prove a MacWilliams identity for the weight adjacency matrices based on the constraint codes of a convolutional code (CC) and its dual. Our result improves upon a recent result by Gluesing-Luerssen and Schneider, where the requirement of a minimal encoder is assumed. We can also establish the MacWilliams identity for the input-parity weight adjacency matrices of a systematic CC and its dual. Most importantly, we show that a type of Hamming weight enumeration functions of all codewords of a CC can be derived from the weight adjacency matrix, which thus provides a connection between these two very different notions of weight enumeration functions in the convolutional code literature. Finally, the relations between various enumeration functions of a CC and its dual are summarized in a diagram. This explains why no MacWilliams identity exists for the free-distance enumerators.
Please use this identifier to cite or link to this item: