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.
| Κύριος συγγραφέας: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Άρθρο |
| Γλώσσα: | en_US |
| Έκδοση: |
Institute of Electrical and Electronics Engineers
2010
|
| Θέματα: | |
| Διαθέσιμο Online: | http://hdl.handle.net/1721.1/59361 |