Effective construction method for locally repairable codes

被引：0

作者：

Wang X. ^{[1
]}

Che S. ^{[1
]}

Ji Y. ^{[1
]}

机构：

[1] State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an

来源：

Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University | 2019年 / 46卷 / 03期

关键词：

Average information locality; Average locality; Locally repairable codes; Tanner graph; Update complexity;

D O I：

10.19665/j.issn1001-2400.2019.03.005

中图分类号：

学科分类号：

摘要：

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. © 2019, The Editorial Board of Journal of Xidian University. All right reserved.

引用

页码：26 / 31

页数：5

共 12 条

[1]

Shahabinejad M., Khabbazian M., Ardakani M., On the Average Locality of Locally Repairable Codes, IEEE Transactions on Communications, 66, 7, pp. 2273-2783, (2018)

[2]

Mehrabi M., Ardakani M., On Minimum Distance of Locally Repairable Codes, Proceedings of the 2017 15th Canadian Workshop on Information Theory, (2017)

[3]

Pollanen A., Westerback T., Freij-Hollanti R., Et al., Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes, Proceedings of the 2016 IEEE International Symposium on Information Theory, pp. 1586-1590, (2016)

[4]

Wang A.Y., Zhang Z.F., Lin D.D., Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields, Proceedings of the 2017 IEEE International Symposium on Information Theory, pp. 2033-2037, (2017)

[5]

Huang P.F., Yaakobi E., Uchikawa H., Et al., Binary Linear Locally Repairable Codes, IEEE Transactions on Information Theory, 62, 11, pp. 6268-6283, (2016)

[6]

Xu H., Sun C., Bai B., Nonbinary LDPC Codes Constructed Based on Cyclic Difference Families, Journal of Xidian University, 44, 1, pp. 6-11, (2017)

[7]

Kim C., No J.S., New Constructions of Binary and Ternary Locally Repairable Codes Using Cyclic Codes, IEEE Communications Letters, 22, 2, pp. 228-231, (2018)

[8]

Luo Y., Xing C.P., Yuan C., Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes, IEEE Transactions on Information Theory, 65, 2, pp. 1048-1053, (2019)

[9]

Mehrabi M., Shahabinejad M., Ardakani M., Et al., Improving the Update Complexity of Locally Repairable Codes, IEEE Transactions on Communications, 66, 9, pp. 3711-3720, (2018)

[10]

Mehrabi M., Ardakani M., Khabbazian M., Minimizing the Update Complexity of Facebook HDFS-RAID Locally Repairable Code, Proceedings of the 2018 IEEE Vehicular Technology Conference, pp. 1-5, (2018)

← 1 2 →