arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.5508cs.ITmath.IT
收藏

图上的码:对偶和MacWilliams恒等式

Codes on graphs: Duality and MacWilliams identities

G. David Forney

摘要:

一个概念框架,涉及正常因子图的分区函数的介绍,类似的最近发展的铝Bashabsheh和毛。证明了对偶正规因子图的配分函数是一个傅里叶变换对,无论图是否有圈。原来的正规图对偶定理作为推论如下。在这个框架内,MacWilliams恒等式被发现用于图上的一般群或线性码的各种局部和全局权重生成函数;这推广并提供了最近由Gluesing-Luerssen和Schneider发现的线性时不变卷积码的MacWilliams恒等式的简洁证明。进一步MacWilliams身份开发终止卷积码,特别是咬尾码,类似于最近研究的Bocharova,拥抱,Johannesson和Kudryashov。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑