MacWilliams identities for codes on graphs
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.
Main Author: | Forney, G. David, Jr (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2010-10-15T14:42:05Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Codes on Graphs: Duality and MacWilliams Identities
by: Forney, G. David, Jr
Published: (2012) -
MacWilliams identities for terminated convolutional codes
by: Forney, G. David, Jr
Published: (2012) -
MacWilliams Identity for Codes with the Rank Metric
by: Gadouleau Maximilien, et al.
Published: (2008-01-01) -
MacWilliams Identity for Codes with the Rank Metric
by: Zhiyuan Yan, et al.
Published: (2008-05-01) -
Complete Weight Distributions and MacWilliams Identities for Asymmetric Quantum Codes
by: Chuangqiang Hu, et al.
Published: (2019-01-01)