Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes
Information Theory
2013-05-15 v2 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1302.1256,
title = {Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes},
author = {Junyu Chen and Kenneth W. Shum},
journal= {arXiv preprint arXiv:1302.1256},
year = {2013}
}
Comments
IEEE Int. Symp. Inf. Theory, 2013