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

共 49 条

[31] Improved Layered Regenerating Codes Characterizing the Exact-Repair Storage-Repair Bandwidth Tradeoff for Certain Parameter Sets
Senthoor, Kaushik
Sasidharan, Birenjith
Kumar, P. Vijay
2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
[32] An Outer Bound on the Storage-Bandwidth Tradeoff of Exact-Repair Regenerating Codes and its Asymptotic Optimality in High Rates
Lee, Hyuk
Lee, Jungwoo
2016 IEEE INFORMATION THEORY WORKSHOP (ITW), 2016,
[33] Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
Rashmi, K. V.
Shah, Nihar B.
Kumar, P. Vijay
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) : 5227 - 5239
[34] New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems
Goparaju, Sreechakra
El Rouayheb, Salim
Calderbank, Robert
2014 48TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2014,
[35] New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems
Goparaju, Sreechakra
El Rouayheb, Salim
Calderbank, Robert
2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1036 - 1040
[36] The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes
Damelin, SB
Michalski, G
Mullen, GL
Stone, D
MONATSHEFTE FUR MATHEMATIK, 2004, 141 (04): : 277 - 288
[37] The Number of Linearly Independent Binary Vectors with Applications to the Construction of Hypercubes and Orthogonal Arrays, Pseudo (t, m, s)-Nets and Linear Codes
S. B. Damelin
G. Michalski
G. L. Mullen
D. Stone
Monatshefte für Mathematik, 2004, 141 : 277 - 288
[38] A New Cooperative Repair Scheme With k+1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization
Liu, Yajuan
Cai, Han
Tang, Xiaohu
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) : 2820 - 2829
[39] Construction of fast recovery codes using a new optimal importance sampling method
Wei, MYC
Wei, L
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 3006 - 3019
[40] Low Complexity Method for Channel-Dependent Construction of Polar Codes Using Partial Order
Feng, Baoping
Liu, Rongke
Dai, Bin
Tian, Kuangda
Sun, He
IEEE ACCESS, 2018, 6 : 67404 - 67414

← 1 2 3 4 5 →