Locality of optimal binary codes

The locality of locally repairable codes (LRCs) for a distributed storage system is the number of nodes that participate in the repair of failed nodes, which characterizes the repair cost. In this paper, we first determine the locality of MacDonald codes, then propose three constructions of LRCs with $r=1,2\text{ and }3$. Based on these results, for $2\le k\le 7$ and $n\ge k+2$, we give an optimal linear $n,k,d]$ code with small locality. The distance optimality of these linear codes can be judged by the codetable of M. Grassl for $n<2(2^k-1)$ and by the Griesmer bound for $n\ge 2(2^k-1)$. Almost all the $n,k,d]$ codes ($2\le k\le 7$) have locality $r\le 3$ except for the three codes, and most of the $n,k,d]$ code with $n<2(2^k-1)$ achieves the Cadambe–Mazumdar bound for LRCs.