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

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.

14 pages

Cited by in corpus (1)

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