Constructions of Optimal Single-Parity Locally Repairable Codes with Multiple Repair Sets
Yang Ding, Qingye LI, Yuting QIU · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2022
Locally repairable codes have attracted lots of interest in Distributed Storage Systems. If a symbol of a code can be repaired respectively by t disjoint groups of other symbols, each groups has size at most r, we say that the code symbol has (r, t)-locality. In this paper, we employ parity-check matrix to construct information single-parity (r, t)-locality LRCs. All our codes attain the Singleton-like bound of LRCs where each repair group contains a single parity symbol and thus are optimal.