Repairing multiple failures in the Suh-Ramchandran regenerating codes
Refereed conference paper presented and published in conference proceedings

CUHK Authors
Author(s) no longer affiliated with CUHK


Times Cited
Altmetrics Information
.

Other information
AbstractUsing 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. © 2013 IEEE.
All Author(s) ListChen J., Shum K.W.
Name of Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
Start Date of Conference07/07/2013
End Date of Conference12/07/2013
Place of ConferenceIstanbul
Country/Region of ConferenceTurkey
Detailed descriptionorganized by IEEE,
Year2013
Month12
Day19
Pages1441 - 1445
ISBN9781479904464
ISSN2157-8095
LanguagesEnglish-United Kingdom
KeywordsDistributed storage systems, interference alignment, regenerating codes, super-regular matrix

Last updated on 2020-24-11 at 00:11