New Repair strategy of Hadamard Minimum Storage Regenerating Code for Distributed Storage System
classification
💻 cs.IT
math.IT
keywords
repairstoragecodehadamardminimumnoderegeneratingstrategy
read the original abstract
The newly presented $(k+2,k)$ Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair property for all single node failures. In this paper, we propose a new simple repair strategy, which can considerably reduces the computation load of the node repair in contrast to the original one.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.