A New Construction of Exact-Repair MSR Codes Using Linearly Dependent Vectors

被引：4

作者：

Guan, Sheng ^{[1
]}

Kan, Haibin ^{[1
]}

Wen, Jie ^{[1
]}

Xia, Shuli ^{[1
]}

机构：

[1] Fudan Univ, Shanghai Key Lab Intelligent Informat Proc, Fudan Zhongan Joint Lab Blockchain & Informat Sec, Sch Comp Sci, Shanghai 200433, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2017年 / 21卷 / 08期

基金：

中国国家自然科学基金;

关键词：

Distributed storage systems; interference alignment; MSR codes; network coding; optimal repair; DISTRIBUTED STORAGE-SYSTEMS;

D O I：

10.1109/LCOMM.2017.2700862

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Regenerating codes focus on the efficient repair of node failures. In an [n, k, d] regenerating code system, any k nodes can retrieve the original data and any d nodes can repair a failed node by giving out beta pieces of data per node. For minimum storage regenerating (MSR) codes, d >= 2k - 3 has been proved. However, as far as we know, there is no construction of exact-repair MSR codes with d = 2k - 3 and beta = 1 at present. In this letter, we give the first construction of [6, 4, 5] MSR codes with beta = 1, which can perform exact repair of all nodes. Employing the technique of linearly dependent vectors, our codes can be constructed over a small finite field F-4.

引用

页码：1691 / 1694

页数：4