A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Locally repairable codes (LRCs) were proposed to reduce the repair degree in distributed storage systems. In particular, LRCs with availability are highly desirable for distributed storage systems, since this kind of codes provide the mechanism of local repair for code symbols and parallel reading of hot data. In this paper, we propose four types of (n, k, r, t)q LRCs from combinatorial designs. We introduce several constructions of LRCs with strict availability and some constructions ofdoi:10.1007/s11432-019-2649-5 fatcat:loeql6eosrdt3hi7nmu4bljqiy