Construction of one special minimum storage regenerating code when α=2

作     者：LIANG SongTao LIANG WenJuan KAN HaiBin 

作者机构：Shanghai Key Laboratory of Intelligent Information Processing School of Computer ScienceFudan University College of Computer and Information Engineering Henan University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2015年第58卷第6期

页      面：116-125页

核心收录：

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 081101[工学-控制理论与控制工程] 0701[理学-数学] 0811[工学-控制科学与工程] 

基　　金：supported in part by the National Natural Science Foundation of China(Grant No.61170208) Shanghai Key Program of Basic Research(Grant No.12JC1401400) the National Defense Basic Research Project(Grant No.JCYJ-1408) 

主　　题：array codes distributed storage network coding maximum-distance-separable(MDS) codes min-imum storage regenerating(MSR) codes 

摘      要：Regenerating codes is one class of erasure codes for distributed storage. A [n, k, d, α, β] regenerating code can recover the original message from any k out of n distributed storage nodes and repair any failed node from other arbitrary d nodes. α is the number of symbols stored in one node and β is the number of symbols downloaded by a newcomer node. Minimum storage regenerating(MSR) code is a regenerating code attaining the minimal storage requirement. In this paper, we address the design of a special MSR code where α = 2 and the first fragment of a node stores original symbol(we call it hybrid systematic MSR code or HS-MSR code). We point out that there exists no exact-repair construction when k 5. A simple exact linear construction is given when k = 2. Furthermore, by relaxing the condition of connecting any d nodes, we investigate the properties of quasi-cyclic regenerating code and propose a unified construction such that when k 3, repairing process can be achieved with less repair bandwidth by repair-by-transfer form.