197 research outputs found
Optimal Locally Repairable Codes via Rank-Metric Codes
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
- …