Tight Bounds of Minimum Distance Distributions of Irregular LDPC Code Ensembles
Tight Bounds of Minimum Distance Distributions of Irregular LDPC Code Ensembles
复制标题
DOI：
10.1109/isit.2007.4557315
复制
发表时间：
2007-06
期刊：
影响因子：
--
通讯作者：
Shinya Miyamoto;K. Kasai;T. Shibuya;K. Sakaniwa
中科院分区：
文献类型：
--
作者：
Shinya Miyamoto;K. Kasai;T. Shibuya;K. Sakaniwa
Callage和Di分别给出了Gallger码和非规则LDPC码的最小距离分布的上界。对于具有二阶可变节点的非规则LDPC码，Di的界是紧的，而对于不具有二阶可变节点的非规则LDPC码，Di的界不是紧的。本文给出了不含二阶变量节点的非规则LDPC码系综的最小距离分布的上、下界。
Upper bounds of minimum distance distributions of Gallger codes and irregular LDPC codes were derived by Callage and Di, respectively. Di's bounds are tight for irregular LDPC codes which have variable nodes of degree two, however, it is not tight for irregular LDPC codes which do not. In this paper, we derive tight lower and upper bounds of minimum distance distributions of irregular LDPC code ensembles without variable nodes of degree two.