Name
Abstract | ||
|---|---|---|
In distributed storage systems, codes with lower repair locality for each coordinate are much more desirable since they can reduce the disk I/O complexity for repairing a failed node. The ith coordinate of a linear code C is said to have (r(i), delta(i)) locality if there exist delta(i) non-overlapping local repair sets of size no more than r(i), where a local repair set of one coordinate is defined as the set of some other coordinates by which one can recover the value at this coordinate. In this paper, we consider linear codes with information (r(min), delta(min), r(max), delta(max)) locality, where there exists an information set I such that for each i epsilon I, the ith coordinate has (r(i), delta(i)) locality and min{r(i) : i epsilon I} = rmin, max{r(i) : i epsilon I} = r(max), min{r(i) : i epsilon I} = r(min) and max{delta(i): i epsilon I}=delta(max). We derive a lower bound on the codeword length n for any linear [n, k, d] code with information (r(min), delta(min); r(max), delta(max)) locality. Particularly, we indicate that some existing bounds can be deduced from our result by restrictions on parameters. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1142/S0129054116500222 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Distributed storage, repair locality, information set, information locality, lower bound | Discrete mathematics,Combinatorics,Locality,Existential quantification,Upper and lower bounds,Distributed data store,Linear code,Code word,Information set,Mathematics,Erasure | Journal |
Volume | Issue | ISSN |
27 | 6 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiyong Lu | 1 | 5 | 3.15 |
| Jun Zhang | 2 | 0 | 0.34 |
| Xuan Guang | 3 | 0 | 2.70 |
| Fang-Wei Fu | 4 | 214 | 38.73 |