Construction of Optimal Locally Repairable Codes Based on RBIBD

被引：0
|
作者：
Wang J. [1 ]
Li J. [1 ]
Yang J. [1 ]
Wang E. [1 ]
机构：
[1] School of Information Engineering, Chang’an University, Xi’an
来源：
Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China | 2023年 / 52卷 / 03期
关键词：
distributed storage system; locally repairable code; minimum distance; resolvable balanced incomplete block design;
D O I：
10.12178/1001-0548.2022158
中图分类号：
学科分类号：
摘要：
With the rapid growth of data, the requirements of the reliability and effectiveness for distributed storage systems are increasing. Locally repairable codes (LRCs) have better locality, which can effectively realize the reliable and efficient storage of massive data in distributed storage system. It has become a research hotspot to construct locally repairable codes with (r, t) locality. Therefore, this paper proposes a construction method of optimal locally repairable codes based on resolvable balanced incomplete block design (RBIBD), which can construct binary optimal single parity LRCs with (r, t) locality of information symbols. The performance analyses show that, the constructed LRCs reach the minimum distance bound, and compared with the LRCs proposed by Xia et al., the LRCs proposed in this paper perform better in code rate. In particular, when the availability t=2, the LRCs is also the code with the optimal code rate. © 2023 Univ. of Electronic Science and Technology of China. All rights reserved.
引用
收藏
页码：366 / 371
页数：5
相关论文
共 22 条
  • [1] SIDDIQA A, KARIM A, GANI A., Big data storage technologies: A survey, Frontiers of Information Technology & Electronic Engineering, 18, 8, pp. 1040-1070, (2017)
  • [2] BSOUL M, ABDALLAH A E, ALMAKADMEH K, Et al., A round-based data replication strategy, IEEE Transactions on Parallel & Distributed Systems, 27, 1, pp. 31-39, (2015)
  • [3] LUO X H, SHU J W., Summary of research for erasure code in storage system, Journal of Computer Research and Development, 49, 1, pp. 1-11, (2012)
  • [4] PAPAILIOPOULOS D S, DIMAKIS A G., Locally repairable codes, IEEE Transactions on Information Theory, 60, 10, pp. 5843-5855, (2014)
  • [5] GOPALAN P, HUANG C, SIMITCI H, Et al., On the locality of codeword symbols, IEEE Transactions on Information Theory, 58, 11, pp. 6925-6934, (2012)
  • [6] LI X D, MA L M, XING C P., Optimal locally repairable codes via elliptic curves, IEEE Transactions on Information Theory, 65, 1, pp. 108-117, (2018)
  • [7] JIN L F., Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes, IEEE Transactions on Information Theory, 65, 8, pp. 4658-4663, (2019)
  • [8] TAMO I, BARG A, GOPARAJU S, Et al., Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes, International Journal of Information and Coding Theory, 3, 4, pp. 345-364, (2016)
  • [9] 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, (2018)
  • [10] RAWAT A S, PAPAILIOPOULOS D S, DIMAKIS A G, Et al., Locality and availability in distributed storage, IEEE Transactions on Information Theory, 62, 8, pp. 4481-4493, (2016)
123