Kovalenko满秩极限和开销作为二进制擦除信道上LDPC和LT码错误性能的下界
信息论
2016-11-17 v2 离散数学
组合数学
math.IT
摘要
我们提出Kovalenko满秩极限作为二进制擦除信道上LDPC码和LT码译码错误概率的紧下界。从该极限出发，我们推导出一个满秩开销，作为这些码成功最大似然译码的稳定开销的下界。
引用
@article{arxiv.0808.0272,
title = {Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels},
author = {Ki-Moon Lee and Hayder Radha and Beom-Jin Kim},
journal= {arXiv preprint arXiv:0808.0272},
year = {2016}
}
备注
A short version of this paper was presented at ISITA 2008, Auckland NZ. The first draft was submitted to IEEE Transactions on Information Theory, 2008/06