On locality of binary distance-optimal codes
Ruipan Yang, Ruihu Li, Qiang Fu, Sen Yang, Yi Rao · Research Square · 2022
Abstract In modern large scale storage systems, locally repairable codes(LRCs) allow to improve the repair efficiency when node failure occurs. In this work, several new methods for constructing LRCs with small locality are discussed using generator and parity-check matrices approach. A large number of new LRCs have been found, which are all distance-optimal (d-optimal) or best known (BK). Based on the new obtained LRCs and known results, a database presenting all d-optimal (or BK) binary LRCs with relatively small locality where n≤40 is given. The majority of them are r-optimal or near r-optimal.