Title :
MacWilliams identities for codes on graphs
Author :
Forney, G. David, Jr.
Author_Institution :
Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA
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.
Keywords :
convolutional codes; graph theory; linear codes; dual sum-product update rule; graph theory; linear time-invariant convolutional codes; Conferences; Convolutional codes; Galois fields; Graphical models; Information theory; Laboratories; Linear code; Standards development; Subspace constraints; Vectors;
Conference_Titel :
Information Theory Workshop, 2009. ITW 2009. IEEE
Conference_Location :
Taormina
Print_ISBN :
978-1-4244-4982-8
Electronic_ISBN :
978-1-4244-4983-5
DOI :
10.1109/ITW.2009.5351248
