Paper Info
Title
New repair strategy of Hadamard minimum storage regenerating code for distributed storage system
Abstract
To be considered for the Special Session celebrating Prof. Kumar's birthday. The newly presented (k + 2, k) Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair properly for all single node failures. In this paper, we propose a new simple repair strategy, which can considerably reduce the computation load of the node repair in contrast to the original one.
Year
DOI
Venue
2013
10.1109/IWSDA.2015.7458385
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)
Keywords
Field
DocType
Distributed storage,MSR,Hadamard,repair strategy,computation load
Computer science,Distributed data store,Parallel computing,First class,Hadamard transform,Computation
Journal
Volume
ISSN
Citations 
abs/1312.5173
2150-3680
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Xiaohu Tang11294121.15
Bin Yang2276.06
Jie Li3486.35