Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs
arXiv:1408.0377 · doi:10.1109/TIT.2015.2408595
Abstract
A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the "help-by-transfer" property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a non-trivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.
This is a combination of the following two papers with additional results (new asymptotic analysis, a better alphabet size bound and smaller repetition factors): arXiv:1302.4670 "Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs" by Tian, Aggarwal, and Vaishampayan, and arXiv:1301.6157 "High-Rate Regenerating Codes Through Layering" by Sasidharan and Kumar
References in corpus (6)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
- Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment
- Fractional Repetition Codes for Repair in Distributed Storage Systems
- Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs
- High-Rate Regenerating Codes Through Layering
Cited by in corpus (15)
- Cascade Codes For Distributed Storage Systems
- A Note on the Rate Region of Exact-Repair Regenerating Codes
- Caching and Delivery via Interference Elimination
- Differentiated latency in data center networks with erasure coded files through traffic engineering
- Determinant Codes with Helper-Independent Repair for Single and Multiple Failures
- Multilinear Algebra for Minimum Storage Regenerating Codes
- Multilinear Algebra for Distributed Storage
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Erasure Coding for Distributed Storage: An Overview
- A Connection Between Locally Repairable Codes and Exact Regenerating Codes
- The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case
- Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point
- On the Achievability Region of Regenerating Codes for Multiple Erasures
- On the Tradeoff Region of Secure Exact-Repair Regenerating Codes
- On the Optimal Minimum Distance of Fractional Repetition Codes