关于平行信道下LDPC码的可实现速率与解码复杂度：信息论边界与应用
信息论
2007-07-13 v1 math.IT
摘要
本文给出低密度奇偶检验(LDPC)码的可实现速率和解码复杂度的边界。假设这些码的通信发生在统计上独立的平行信道上，这些信道是无记忆的、二进制输入且输出对称(MBIOS)的。这些边界应用于被掏空的LDPC码。本文讨论以图表形式呈现，展示本文中的定理与先前结果之间的相互关联。
引用
@article{arxiv.cs/0512076,
title = {On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications},
author = {Igal Sason and Gil Wiechman},
journal= {arXiv preprint arXiv:cs/0512076},
year = {2007}
}
备注
5 pages. The paper is submitted to the 2006 IEEE International Symposium on Information Theory (ISIT 2006), Seatle, Washington, USA, 9--14 July, 2006. The full paper version was submitted to the IEEE Trans. on Information Theory, August 2005 and is online available at http://arxiv.org/abs/cs.IT/0508072