Bounds and constructions for linear locally repairable codes over binary fields
Bounds and constructions for linear locally repairable codes over binary fields
For binary [n, k, d] linear locally repairable codes (LRCs), two new upper bounds on k are derived. The first one applies to LRCs with disjoint local repair groups, for general values of n, d and locality r, containing some previously known bounds as special cases. The second one is …