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

TL;DR

This paper introduces a new repair strategy for Hadamard MSR codes in distributed storage, significantly reducing computational load during node repair while maintaining optimal repair properties.

Contribution

It proposes a simple, more efficient repair strategy for Hadamard MSR codes, enhancing practical repair performance in distributed storage systems.

Findings

Reduced computational load during node repair

Maintains optimal repair property for all single node failures

First high-rate storage code with these features

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.