一种有效的局部可修复码的构造方法

为了能够同时优化局部可修复码的平均信息修复度、平均修复度以及更新复杂度,并降低构造局部可修复码的算法复杂度,通过分析Tanner图的特点,提出了一种新的构造方法。首先,对局部校验节点进行设计,在满足局部可修复码的平均信息修复度为最优的基础上,通过区分局部组的特点,对重叠组进行分类构造,优化码的平均修复度;其次,对全局校验节点进行设计,优化码的更新复杂度;最后对构造码的算法复杂度进行分析和对比。结果表明,所提出的方法优化了以上所述的性能,且降低了局部可修复码在构造过程中的复杂度。

Effective construction method for locally repairable codes

In order to optimize average information locality, average locality and update complexity of Locally Repairable Codes(LRC) at the same time, and reduce the algorithm complexity of constructing LRC, a new construction method is proposed by analyzing the characteristics of the Tanner graph. First, the local check nodes are designed. On the basis of the fact that the LRC’s average information locality is optimal, by distinguishing the characteristics of the local groups, the average locality is optimized by construction of overlapping groups; second, the update complexity is optimized by designing the global check nodes; finally, the algorithm complexity is analyzed and compared. The results show that the proposed method optimizes the performance above and reduces the complexity of constructing LRC.