Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel

Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel
复制标题

二进制擦除通道上泊松LDPC码条件熵的精确解

DOI:
10.1109/isit.2007.4557357
复制
发表时间:
2007
期刊:
2007 IEEE International Symposium on Information Theory
影响因子:
--
通讯作者:
N. Macris
N. Macris
中科院分区:
--
文献类型:
--
作者:
Satish Babu Korada;S. Kudekar;N. Macris

文献摘要

参考文献

被引文献

相似文献

我们考虑通信的二进制擦除信道的低密度奇偶校验码和最佳的最大后验译码。众所周知,在大块长度的渐近极限下,在这样的代码集合上计算平均条件熵的问题与在热力学极限下计算平均场自旋玻璃的自由能密切相关。由于(自旋玻璃理论的)复制方法,这些量的试验性但明确的公式已经推导出来,并且通常被证明是精确的。在本文中,我们证明了在Poissonian低密度奇偶校验系综的情况下,副本公式确实是精确的。我们的方法使用的想法来自最近的进展,在严格的分析谢灵顿-柯克帕特里克模型及其应用的纠错码理论。
We consider communication over a binary erasure channel with low density parity check codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code ensembles, in the asymptotic limit of large block length is closely related to computing the free energy of a mean field spin glass in the thermodynamic limit. Tentative, but explicit, formulas for these quantities have been derived thanks to the replica method (of spin glass theory) and are generally conjectured to be exact. In this contribution we show that the replica formulas are indeed exact in the case of Poissonian low density parity check ensembles. Our methods use ideas coming from the recent progress in the rigorous analysis of the Sherrington-Kirkpatrick model and their applications to the theory of error correcting codes.
INFN 比萨/INFN 罗马(意大利)
DOI: --
发表时间: --
期刊:
影响因子: --
作者:
通讯作者: --