Codes between MBR and MSR Points with Exact Repair Property
arXiv:1312.5106 · doi:10.1109/TIT.2014.2351252
Abstract
In this paper distributed storage systems with exact repair are studied. A construction for regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points is given. To the best of author's knowledge, no previous construction of exact-regenerating codes between MBR and MSR points is done except in the work by Tian et al. On contrast to their work, the methods used here are elementary. In this paper it is shown that in the case that the parameters , , and are close to each other, the given construction is close to optimal when comparing to the known functional repair capacity. This is done by showing that when the distances of the parameters , , and are fixed but the actual values approach to infinity, the fraction of the performance of constructed codes with exact repair and the known capacity of codes with functional repair, approaches to one. Also a simple variation of the constructed codes with almost the same performance is given.
arXiv comment21 pages, 16 figures, submitted to IEEE Transactions on Information Theory
References in corpus (6)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Zigzag Codes: MDS Array Codes with Optimal Rebuilding
- Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
- Capacity and Security of Heterogeneous Distributed Storage Systems
- Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment
- Exact-Regenerating Codes between MBR and MSR Points