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
相关论文
共 13 条
[1]  
[Anonymous], 2007, Computer Vision
[2]  
Cullina D., 2009, SEARCHING MINIMUM ST
[3]   Network Coding for Distributed Storage Systems [J].
Dimakis, Alexandros G. ;
Godfrey, P. Brighten ;
Wu, Yunnan ;
Wainwright, Martin J. ;
Ramchandran, Kannan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) :4539-4551
[4]   Two-Layer Coding in Distributed Storage Systems With Partial Node Failure/Repair [J].
Gerami, Majid ;
Xiao, Ming ;
Skoglund, Mikael .
IEEE COMMUNICATIONS LETTERS, 2017, 21 (04) :726-729
[5]   Partial Repair for Wireless Caching Networks With Broadcast Channels [J].
Gerami, Majid ;
Xiao, Ming ;
Skoglund, Mikael .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2015, 4 (02) :145-148
[6]   Construction of one special minimum storage regenerating code when α=2 [J].
Liang SongTao ;
Liang WenJuan ;
Kan HaiBin .
SCIENCE CHINA-INFORMATION SCIENCES, 2015, 58 (06) :1-10
[7]   Linear Exact-Repair Construction of Hybrid MSR Codes in Distributed Storage Systems [J].
Liang, Songtao ;
Yuan, Chen ;
Kan, Haibin .
IEEE COMMUNICATIONS LETTERS, 2014, 18 (07) :1095-1098
[8]   Repair Optimal Erasure Codes Through Hadamard Designs [J].
Papailiopoulos, Dimitris S. ;
Dimakis, Alexandros G. ;
Cadambe, Viveck R. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (05) :3021-3037
[9]   Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction [J].
Rashmi, K. V. ;
Shah, Nihar B. ;
Kumar, P. Vijay .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) :5227-5239
[10]   Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions [J].
Shah, Nihar B. ;
Rashmi, K. V. ;
Kumar, P. Vijay ;
Ramchandran, Kannan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (04) :2134-2158
12