摘要
局部修复码可以提高分布式存储系统中失效节点的修复效率,是分布式存储编码领域的研究热点。文章研究最优局部修复码的构造,利用二元常重量码构造了两类矩阵,并以这两类矩阵作为校验矩阵,构造了局部性为r、最小距离分别为d=5和d=6的两类最优局部修复码。
Locally repairable codes are able to improve the efficiency of repairing lost nodes in distributed storage systems,and they are a hot research direction in distributed storage coding.In this paper,we consider the constructions of optimal locally repairable codes.Two classes of matrices are constructed by binary constant weight codes,then using these matrices as the parity-check matrices we construct two classes of optimal locally repairable codes with locality r,and of minimum distance d=5 and d=6.
作者
李锦
申大玲
LI Jin;SHEN Daling(School of Mathematics, Hefei University of Technology, Hefei 230601, China)
出处
《合肥工业大学学报（自然科学版）》
CAS
北大核心
2021年第7期993-997,共5页
Journal of Hefei University of Technology：Natural Science
基金
国家自然科学基金资助项目(11501156)
安徽省自然科学基金资助项目(1508085SQA189)。
关键词
分布式存储系统
局部修复码
最优码
distributed storage system
locally repairable code
optimal code
作者简介
李锦(1987—),女,陕西咸阳人,博士,合肥工业大学副教授,硕士生导师.
