The Upper Bound of Minimum Distance in (r, δ)-local t-LRC Codes
Anahita Kazemi, Mehdi Ghiyasvand · 2021
A code is called locally repairable code (LRC) with availability in a distributed storage system if the i-th coded symbol of a [n, k] linear code C has several disjoint sets of code symbols called recovering sets such that it can be recovered from them. Locality refers to the size of the recovering set. In this paper we study the LRCs to the (r, δ)-locality case (δ > 2) of multiple node failures. Such codes ensure could be repaired more quickly and this procedure is useful in reducing repair cost.