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
Recently, the (r, t)-locally repairable code has attracted a lot of attention due to its potential application in distributed storage systems for hot data. A locally repairable code with locality r and availability t, which is termed an (r, t)-LRC, is a code satisfying the property that the value at each coordinate can be recovered from t disjoint repair sets, each set consists of at most r other coordinates. In this paper, we investigate two constructions of (r, t)-LRCs. The first one is adoi:10.1109/isit.2016.7541338 dblp:conf/isit/WangZL16 fatcat:l6frfe3qofevhbbrgz6b3s5fey