Based on the known principle of fixed points in mathematical analysis, a sufficient convergence condition of erasure decoding algorithm for erasure codes is shown.
基于数学分析中著名的不动点原理，对于低密度纠删码本文证明了其删除错误译码算法稳定收敛的一充分条件。
It is pointed out that the design of sequences of degree distribution in bipartite graphs is one of the most important problems in constructing low-density erasure codes.
其中二部图度序列的设计是构造低密度纠删码的最关键问题之一。
By investigating analytical properties of the right regular sequences in detail, the parameter-optimization algorithm of degree sequences for right regular erasure codes is designed.
通过深入研究右边正则度序列的分析性质，设计了右边正则纠删码度序列的参数优化算法。
By investigating analytical properties of the right regular sequences in detail, the parameter-optimization algorithm of degree sequences for right regular erasure codes is designed.
通过深入研究右边正则度序列的分析性质，设计了右边正则纠删码度序列的参数优化算法。
应用推荐