MacWilliams identities for codes on graphs
Author(s)Forney, G. David, Jr.
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
IEEE Information Theory Workshop, 2009
Institute of Electrical and Electronics Engineers
Forney, G. David, Jr. (2009). "MacWilliams identifies for codes on graphs." IEEE Information Theory Workshop, 2009 (Piscataway, N.J.: IEEE): 120-124. © 2009 IEEE
Final published version
INSPEC Accession Number: 11009040
dual sum-product update rule, graph theory, linear time-invariant convolutional codes, convolutional codes, graph theory, linear codes