Optimal Locally Repairable Codes via Rank-Metric Codes

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 (3)

• Codes with Local Regeneration
• Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems
• Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction

Cited by in corpus (17)

• Codes with Locality for Two Erasures
• Bounds and Constructions of Locally Repairable Codes: Parity-check Matrix Approach
• Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization
• Some Improvements on Locally Repairable Codes
• Optimal binary linear locally repairable codes with disjoint repair groups
• Cooperative Regenerating Codes
• Codes With Hierarchical Locality
• Erasure Coding for Distributed Storage: An Overview
• 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
• Some Gabidulin Codes cannot be List Decoded Efficiently at any Radius
• Optimal cyclic $(r,\delta )$ locally repairable codes with unbounded length
• Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions
• Codes with Unequal Disjoint Local Erasure Correction Constraints
• Locally Repairable Codes with Multiple $(r_i,{\delta }_i)$-Localities