MacWilliams Identities for Codes on Graphs
classification
💻 cs.IT
math.IT
keywords
codesgraphsmacwilliamsarbitrarybeenconciselyconvolutionaldevelopment
read the original abstract
The MacWilliams identity for linear time-invariant convolutional codes that has recently been found by Gluesing-Luerssen and Schneider is proved concisely, and generalized to arbitrary group codes on graphs. A similar development yields a short, transparent proof of the dual sum-product update rule.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.