MacWilliams identities for codes on graphs
Name
Forney-2009-MacWilliams identities for codes on graphs.pdf
Size
303.35 KB
Format
Adobe PDF
Checksum (MD5)
534d3261617a397bd5f3e54f2135e9a1
Author(s)
Forney, G. David, Jr.
Date Issued
December 2009
Journal
IEEE Information Theory Workshop, 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Forney, G. David, Jr. (2009). "MacWilliams identifies for codes on graphs." IEEE Information Theory Workshop, 2009 (Piscataway, N.J.: IEEE): 120-124. © 2009 IEEE
Version
Final published version
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.
Subjects
dual sum-product update rule
graph theory
linear time-invariant convolutional codes
convolutional codes
graph theory
linear codes
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5351248
