基于RBIBD的最优局部修复码构造

Construction of Optimal Locally Repairable Codes Based on RBIBD

随着数据量的迅速增长,对存储海量数据的分布式存储系统的可靠性和有效性的要求日益增加。局部修复码(LRCs)具有良好的修复局部性,能够有效实现海量数据在分布式存储系统中的可靠高效存储,构造具有(r,t)局部性的局部修复码已经成为当前研究的热点。为此,提出了一种基于可分解均衡不完全区组设计(RBIBD)的最优局部修复码的构造方法,构造信息位具有(r,t)局部性的二元最优单校验LRCs。性能分析表明,构造的LRCs达到了最小距离最优边界,且在码率上表现得更优。

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.