Optimal Locally Repairable Codes via Rank-Metric Codes
Natalia Silberstein, Ankit Singh Rawat, O. Ozan Koyluoglu, and Sriram, Vishwanath
TL;DR
This paper introduces a novel explicit construction of optimal locally repairable codes (LRCs) using rank-metric Gabidulin codes, achieving maximum fault tolerance and efficient node repair in distributed storage systems.
Contribution
It provides a new construction method for optimal LRCs with all-symbols locality based on MRD Gabidulin codes, enhancing fault tolerance and repair efficiency.
Findings
Constructed new optimal vector and scalar LRCs
Achieved maximum possible minimum distance for LRCs
Demonstrated efficient node repair mechanisms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Caching and Content Delivery · Cellular Automata and Applications