Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs
arXiv:1302.4670
Abstract
A new class of exact-repair regenerating codes is constructed by combining two layers of erasure correction codes together with combinatorial block designs, e.g., Steiner systems, balanced incomplete block designs and t-designs. The proposed codes have the "uncoded repair" property where the nodes participating in the repair simply transfer part of the stored data directly, without performing any computation. The layered error correction structure makes the decoding process rather straightforward, and in general the complexity is low. We show that this construction is able to achieve performance better than time-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes.
7 figures, 30 pages. Part of the result has been submitted to ISIT 2013
References in corpus (5)
- Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment
- Fractional Repetition Codes for Repair in Distributed Storage Systems
- MDS Array Codes with Optimal Rebuilding