Outer bounds for exact repair codes
arXiv:1406.4852
Abstract
We address the open problem of establishing the rate region for exact-repair regenerating codes for given parameters (n,k,d). Tian determined the rate region for a (4,3,3) code and found that it lies strictly within the functional-repair rate region. Using different methods, Sasidharan, Senthoor and Kumar proved a non-vanishing gap between the functional-repair outer bound and the exact-repair outer bound for codes with k>=3. Our main results are two improved outer bounds for exact-repair regenerating codes. They capture and then extend essential parts in the proofs by Tian and by Sasidharan, Senthoor and Kumar. We show that the bounds can be combined for further improvements.
14 pages, 1 figure
References in corpus (2)
Cited by in corpus (9)
- A Note on the Rate Region of Exact-Repair Regenerating Codes
- Multilinear Algebra for Distributed Storage
- Multilinear Algebra for Minimum Storage Regenerating Codes
- A Connection Between Locally Repairable Codes and Exact Regenerating Codes
- Erasure Coding for Distributed Storage: An Overview
- Centralized Multi-Node Repair Regenerating Codes
- On the Achievability Region of Regenerating Codes for Multiple Erasures
- On the Tradeoff Region of Secure Exact-Repair Regenerating Codes
- On Secure Exact-repair Regenerating Codes with a Single Pareto Optimal Point