Computer Science – Information Theory
Scientific paper
2009-11-29
Computer Science
Information Theory
30 pages, 20 figures. Accepted for IEEE Transactions on Information Theory. Preliminary versions presented at IEEE Information
Scientific paper
A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier transform pair, whether or not the graphs have cycles. The original normal graph duality theorem follows as a corollary. Within this framework, MacWilliams identities are found for various local and global weight generating functions of general group or linear codes on graphs; this generalizes and provides a concise proof of the MacWilliams identity for linear time-invariant convolutional codes that was recently found by Gluesing-Luerssen and Schneider. Further MacWilliams identities are developed for terminated convolutional codes, particularly for tail-biting codes, similar to those studied recently by Bocharova, Hug, Johannesson and Kudryashov.
No associations
LandOfFree
Codes on graphs: Duality and MacWilliams identities 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 Codes on graphs: Duality and MacWilliams identities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Codes on graphs: Duality and MacWilliams identities will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-151090