Codes Between MBR and MSR Points With Exact Repair Property
Author:
- 22 August 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (11) , 6993-7005
Abstract
In this paper, distributed storage systems with exact repair are studied. Constructions for exact-regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points are given. To the best of our knowledge, no previous construction of exact-regenerating codes between MBR and MSR points is done except in the works by Tian et al. and Sasidharan et al. In contrast to their works, the methods used here are elementary. In this paper, it is shown that in the case that the parameters \(n\) , \(k\) , and \(d\) are close to each other, the given construction is close to optimal when comparing with the known functional repair capacity. This is done by showing that when the distances of the parameters \(n\) , \(k\) , and \(d\) 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. Also some bounds for the capacity of exact-repairing codes are given. These bounds illustrate the relationships between storage codes with different parameters.
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Rate region of the (4, 3, 3) exact-repair regenerating codes2013
- Codes with local regeneration2013
- Zigzag Codes: MDS Array Codes With Optimal RebuildingIEEE Transactions on Information Theory, 2012
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth TradeoffIEEE Transactions on Information Theory, 2011
- Repair optimal erasure codes through hadamard designs2011
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix ConstructionIEEE Transactions on Information Theory, 2011
- Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Explicit construction of optimal exact regenerating codes for distributed storage2009
- Reducing repair traffic for erasure coding-based storage via interference alignment2009