(k+2,k)的Hadamard极小存储再生码的明显修复方案

Concrete Optimal Repair Strategy for (k+2,k) Hadamard Minimum Storage Regenerating Codes

(k+2,k)的Hadamard极小存储再生(MSR)码是一类对所有的失效单节点都具有最优修复属性的高码率纠删码.在已有研究工作的基础上,本文进一步研究一些矩阵的特殊结构,并借助Hadamard设计的基本性质,给出了一些大型矩阵的逆矩阵,获得了(k+2,k)的MSR码在单节点失效时的明显修复方案,从而使得(k+2,k)的MSR码的更加有效应用.

The（k＋2,k）Hadamard minimum storage regenerating（MSR）code is a high rate storage code with optimal repair for all single node failures.This paper uses the techniques of Tang et al.s work and properties of Hadamard designs,gives inverses of some special matrices,and presents concrete,efficient,and optimal repair computation for all the single nodes failures.