Name
Abstract | ||
|---|---|---|
Fractional repetition (FR) codes form a special class of minimum bandwidth regenerating codes by providing uncoded repairs with a table-based repair model. In this paper, we focus on a lower bound on the reconstruction degree of FR codes, which is the smallest number of storage nodes required for data retrieval. We show that for an FR code with reconstruction degree attaining this lower bound, the corresponding dual FR code is optimal with respect to an upper bound on the file size, and vice versa. Using this duality relationship, we present several families of FR codes with optimal reconstruction degree. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849748 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Keywords | Field | DocType |
Terms Regenerating codes, fractional repetition codes, data reconstruction, combinatorial designs, regular graphs | Discrete mathematics,Data reconstruction,Upper and lower bounds,Computer science,Data retrieval,File size,Duality (optimization),Bandwidth (signal processing),Combinatorial design,Versa | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhu Bing | 1 | 75 | 10.85 |
| Kenneth W. Shum | 2 | 0 | 0.34 |
| Hui Li | 3 | 1 | 1.05 |
| Weiping Wang | 4 | 5 | 0.90 |