中文摘要：

提出了一种可以获得最小比特错误概率的网络低密度奇偶校验（LDPC）码速率兼容删余算法，并推导了该算法的译码错误概率．该算法基于网络LDPC码的结构特点，以达到译码最小比特错误概率为目标，在网络LDPC码的Tanner图上搜索出需要删余的变量节点，以获得最优的删余图样．仿真结果表明，该算法比现有算法在BER为10^-4时有0．4dB的性能增益．

英文摘要：

A rate-compatible puncturing algorithm for network LDPC codes is proposed to achieve the minimum error probability, and decoding error probability is derived. The algorithm for finding variable nodes to be deleted based on the tanner graph of network LDPC codes is proposed, which is aimed at minimizing the decoding error probability and optimizing the puncturing pattern. Simulation results illustrate that, at BER= 10^-4, the proposed rate-compatible network LDPC codes have a coding gain of about 0.4 dB compared with the codes obtained via the existing punctured methods.