MacWilliams identities for codes on graphs

Author(s)
Forney, G. David, Jr.
Thumbnail
DownloadForney-2009-MacWilliams identities for codes on graphs.pdf (303.3Kb)
PUBLISHER_POLICY
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.
Metadata
Show full item record
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.
Date issued
2009-12
URI
http://hdl.handle.net/1721.1/59361
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
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
Other identifiers
INSPEC Accession Number: 11009040
ISBN
978-1-4244-4982-8
Keywords
dual sum-product update rule, graph theory, linear time-invariant convolutional codes, convolutional codes, graph theory, linear codes
Collections