A connection between locally repairable codes and exact regenerating codes
Open Access
- 11 August 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 650-654
Abstract
Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those of the other. In this paper, a novel connection between locally repairable codes and exact regenerating codes is established. Via this connection, locally repairable codes are interpreted as exact regenerating codes. Further, some of these codes are shown to perform better than time-sharing codes between minimum bandwidth regenerating and minimum storage regenerating codes.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block DesignsIEEE Transactions on Information Theory, 2015
- Codes Between MBR and MSR Points With Exact Repair PropertyIEEE Transactions on Information Theory, 2014
- An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes2014
- A Family of Optimal Locally Recoverable CodesIEEE Transactions on Information Theory, 2014
- Capacity and Security of Heterogeneous Distributed Storage SystemsIEEE Journal on Selected Areas in Communications, 2013
- Exact-repair regenerating codes via layered erasure correction and block designs2013
- High-rate regenerating codes through layering2013
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed StorageIEEE Transactions on Information Theory, 2013
- Repair optimal erasure codes through hadamard designs2011
- MDS array codes with optimal rebuilding2011