Exact scalar minimum storage coordinated regenerating codes
Author:
- 1 July 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1197-1201
Abstract
We study the exact and optimal repair of multiple failures in codes for distributed storage. More particularly, we examine the use of interference alignment to build exact scalar minimum storage coordinated regenerating codes (MSCR). We show that it is possible to build codes for the case of k = 2 and d ≥ k by aligning interferences independently but that this technique cannot be applied as soon as k ≥ 3 and d >; k. Our results also apply to adaptive regenerating codes.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code ConstructionsIEEE Transactions on Information Theory, 2011
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth TradeoffIEEE Transactions on Information Theory, 2011
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix ConstructionIEEE Transactions on Information Theory, 2011
- Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems2011
- Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes2011
- Cooperative Regenerating Codes for Distributed Storage Systems2011
- Exact-Repair MDS Code Construction Using Interference AlignmentIEEE Transactions on Information Theory, 2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network CodingIEEE Journal on Selected Areas in Communications, 2010
- Explicit codes minimizing repair bandwidth for distributed storage2010