Optimal Locally Repairable Codes via Rank-Metric Codes
arXiv:1301.6331
Abstract
This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems which possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides new optimal vector and scalar LRCs. In addition, the paper also discusses mechanisms by which codes obtained using this construction can be used to construct LRCs with efficient repair of failed nodes by combination of LRC with regenerating codes.
References in corpus (2)
Cited by in corpus (7)
- Some Improvements on Locally Repairable Codes
- Optimal binary linear locally repairable codes with disjoint repair groups
- Codes With Hierarchical Locality
- Distributed Storage Systems based on Equidistant Subspace Codes
- Irregular Recovery and Unequal Locality for Locally Recoverable Codes with Availability
- Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields
- Optimal Locally Repairable Codes with Improved Update Complexity