Name
Abstract | ||
|---|---|---|
In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large - a very strong guarantee - and Locally Recoverable Codes (LRCs) when s is small - a relatively weaker guarantee. This motivates the study of the s-DRGP for intermediate s, which is the focus of our paper. We construct codes in this parameter regime which have a higher rate than previously known codes. Our construction is based on a novel variant of the lifted codes of Guo, Kopparty and Sudan. Beyond the results on the s-DRGP, we hope that our construction is of independent interest, and will find uses elsewhere. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.4230/LIPIcs.APPROX-RANDOM.2017.43 | international workshop and international workshop on approximation, randomization, and combinatorial optimization. algorithms and techniques |
DocType | Volume | Citations |
Conference | abs/1704.08627 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Luna Frank-Fischer | 1 | 0 | 0.34 |
| V. Guruswami | 2 | 3205 | 247.96 |
| Mary Wootters | 3 | 172 | 25.99 |