New Repair strategy of Hadamard Minimum Storage Regenerating Code for Distributed Storage System

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.Comment: 14 page

Optimal Exact Repair Strategy for the Parity Nodes of the (k+2,k)(k+2,k) Zigzag Code

In this paper, we reinterprets the $(k+2,k)$ Zigzag code in coding matrix and then propose an optimal exact repair strategy for its parity nodes, whose repair disk I/O approaches a lower bound derived in this paper.Comment: 11 page