Constructions of Optimal Single-Parity Locally Repairable Codes with Multiple Repair Sets

Locally repairable codes have attracted lots of interest in Distributed Storage Systems. If a symbol code can be repaired respectively by t disjoint groups other symbols, each has size at most r, we say that the (r, t)-locality. In this paper, employ parity-check matrix to construct information single-parity t)-locality LRCs. All our attain Singleton-like bound LRCs where repair group contains single parity and thus are optimal.