2000 character limit reached
MacWilliams Identities for Codes on Graphs (0903.4207v2)
Published 24 Mar 2009 in cs.IT and math.IT
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.