A Connection Between Locally Repairable Codes and Exact Regenerating Codes
arXiv:1603.05846 · doi:10.1109/ISIT.2016.7541379
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.
Conference, submitted
References in corpus (7)
- A family of optimal locally recoverable codes
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs
- Outer bounds for exact repair codes
- Codes between MBR and MSR Points with Exact Repair Property
- When and By How Much Can Helper Node Selection Improve Regenerating Codes?
- Locally Repairable Codes and Matroid Theory