最优LDPC码校验节点度分布多项式

Optimal Check Node Degree Distribution Polynomial of LDPC Code

证明了当错误率满足一定条件时,校验节点度分布多项式只有两个非零项并且次数连续时是最优的。这个结果用于LDPC码的优化时,有助于减少搜索空间,降低了计算量。

When initial error probability is less than a certain value, the optimal check node degree distribution polynomial only has two non-zero coefficients with successive orders of power. The calculation complexity can be reduced when the result is used to optimize LDPC code.