Suh-Ramchandran再生码的多重失效修复
Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes
摘要：
利用干扰对齐的思想，Suh和Ramchandran构造了一类最小存储再生码，该再生码能够以最优修复带宽修复一个系统节点或一个校验节点。在相同的代码结构下，我们证明了除了单节点故障，双节点故障也可以协同修复，并具有最优修复带宽。给出了六结点Suh-Ramchandran再生码的双重失效修复的一个例子，并给出了一般情况下的证明.
英文摘要：
Using the idea of interference alignment, Suh and Ramchandran constructed a class of minimum-storage regenerating codes which can repair one systematic or one parity-check node with optimal repair bandwidth. With the same code structure, we show that in addition to single node failure, double node failures can be repaired collaboratively with optimal repair bandwidth as well. We give an example of how to repair double failures in the Suh-Ramchandran regenerating code with six nodes, and give the proof for the general case.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
