|
Title:
|
MacWilliams identities for codes on graphs |
|
Author:
|
Forney, G. David, Jr. |
|
Department:
|
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems; Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science |
|
Publisher:
|
Institute of Electrical and Electronics Engineers |
|
Issue Date:
|
2009-12 |
|
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. |
|
URI:
|
http://hdl.handle.net/1721.1/59361
|
|
Other Identifiers:
|
INSPEC Accession Number: 11009040 |
|
ISBN:
|
978-1-4244-4982-8 |
|
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 |
|
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. |
|
Published as:
|
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5351248
|
|
Journal:
|
IEEE Information Theory Workshop, 2009 |
