MacWilliams Identities for Codes on Graphs

Details MacWilliams Identities for Codes on Graphs MacWilliams Identities for Codes on Graphs

2009-03-24

arxiv.org/abs/0903.4207v2

Computer Science

Information Theory

5 pages, 2 figures; final version to be presented at IEEE Information Theory Workshop, Taormina, Sicily, Oct. 11-16, 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

MacWilliams Identities for Codes on Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with MacWilliams Identities for Codes on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MacWilliams Identities for Codes on Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67738