Name
Abstract | ||
|---|---|---|
A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbol using only r other codeword symbols. A Singleton-type bound dictates the best possible tradeoff between the dimension and distance of LRCs-an LRC attaining this tradeoff is deemed optimal. Such optimal LRCs have been constructed over alphabets growing linearly in the block length. Unlike the class... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2019.2891765 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Upper bound,Linear codes,Distributed databases,Reed-Solomon codes,Explosions | Discrete mathematics,Combinatorics,Locality,Upper and lower bounds,Computer science,Block code,Code word,Singleton bound,Alphabet | Journal |
Volume | Issue | ISSN |
65 | 6 | 0018-9448 |
Citations | PageRank | References |
5 | 0.42 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Guruswami | 1 | 3205 | 247.96 |
| Chaoping Xing | 2 | 916 | 110.47 |
| Chen Yuan | 3 | 27 | 12.30 |