Journal of Xidian University ›› 2019, Vol. 46 ›› Issue (3): 26-31.doi: 10.19665/j.issn1001-2400.2019.03.005

Previous Articles     Next Articles

Effective construction method for locally repairable codes

WANG Xiangxu,CHE Shuling,JI Yuhui   

  1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi’an 710071, China
  • Received:2018-11-26 Online:2019-06-20 Published:2019-06-19

Abstract:

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.

Key words: locally repairable codes, Tanner graph, update complexity, average locality, average information locality

CLC Number: 

  • TN911.2

Baidu
map