一类精确修复多个错误的Suh-Ramchandram码*

再生码因能有效的减少修复带宽更适用于分布式存储系统。利用干扰对齐技术,对于任意的参数 满足 且 ,Suh和Ramchandram构造了一类修复一个失效节点时,可达到最优修复带宽的最小存储再生码。 Chen和Shum证明了对于参数满足 的Suh-Ramchandram再生码,可以合作修复多个失效节点。基于Suh-Ramchandram再生码,给出了参数为 的编码结构,并说明这种参数为 的最小存储再生码为一类可修复多个失效节点的Suh-Ramchandram 再生码,而且这类码在修复单个或多个节点的失效时均可达到最优的修复带宽。

A Class of Sun-Ramchandram Codes with Exact Multi-failure Repair

Regenerating codes are more suitable for distributed storage system since it can effectively reduce the repair bandwidth. By using the interference alignment technique, Suh and Ramchandram constructed a class of minimum storage regenerating codes, which can repair a single failure node with optimal repair bandwidth for any parameters such that and . Chen and Shum proved that the Suh-Ramchandram regenerating codes with parameters can repair multiple failure nodes. Based on Suh-Ramchandram regenerating codes, a class of minimum storage regenerating codes with parameters is proposed, and it is shown that the constructed minimum storage regenerating codes can achieve optimal repair bandwidth for either single or multiple nodes failure repair.