摘要

The newly presented (k + m, k) Hadamard minimum storage regenerating (MSR) codes are a class of high rate storage codes with optimal repair property for single node failure. In this paper, we propose a new simple optimal repair strategy for (k + m, k) Hadamard MSR codes, which can considerably reduce the computation compared with the original one during the node repair.