Locally repairable codes from combinatorial designs

被引：6

作者：

Zhang, Yu ^{[1
,2
,3
,4
]}

Kan, Haibin ^{[1
,2
,3
,4
]}

机构：

[1] Fudan Univ, Sch Comp Sci, Shanghai Key Lab Intelligent Informat Proc, Shanghai 200433, Peoples R China

[2] Shanghai Engn Res Ctr Blockchain, Fudan Zhongan Joint Lab Blockchain & Informat Sec, Shanghai 200433, Peoples R China

[3] Shanghai Inst Adv Commun & Data Sci, Shanghai 200433, Peoples R China

[4] Shanghai Inst Intelligent Elect & Syst, Shanghai 200433, Peoples R China

来源：

SCIENCE CHINA-INFORMATION SCIENCES | 2020年 / 63卷 / 02期

基金：

中国国家自然科学基金;

关键词：

locally repairable codes; erasure codes; combinatorial designs; distributed storage systems; codes with availability;

D O I：

10.1007/s11432-019-2649-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Locally repairable codes (LRCs) were proposed to reduce the repair degree in distributed storage systems. In particular, LRCs with availability are highly desirable for distributed storage systems, since this kind of codes provide the mechanism of local repair for code symbols and parallel reading of hot data. In this paper, we propose four types of (n, k, r, t)(q) LRCs from combinatorial designs. We introduce several constructions of LRCs with strict availability and some constructions of distance-optimal LRCs with information-symbol locality. Most of our constructions in this paper are over F2, i.e., they are suitable for implementation.

引用

页数：15

共 21 条

[1]

[Anonymous], 2017, ARXIV171009638

[2] Erasure coding for distributed storage: an overview [J].