Locally repairable codes (LRCs) have emerged as an important coding scheme in
distributed storage systems (DSSs) with relatively low repair costs by accessing fewer non …

In this paper, we focus on Singleton-optimal (r, δ) LRCs with disjoint local repair groups. We
provide an improved bound for the length of q-ary Singleton-optimal (r, δ) LRCs based on …

A locally repairable code (LRC) is a code that can recover any symbol of a codeword by
reading at most r other symbols, denoted by r-LRC. In this paper, we study binary and …

An-locally repairable code (LRC) is called a Singleton-optimal LRC if it achieves the
Singleton-type bound. Analogous to the classical MDS conjecture, the maximal length …

Locally repairable codes (LRCs) are an important class of codes to minimize the number of
nodes contacted during repairing in distributed storage systems (DSSs). LRCs with locality …

In this paper, we investigate some properties of inter-sections of two binary (n,k,r) LRCs with
disjoint repair groups when m\triangleqnr+1 is an integer. We first prove a necessary and …