Name
Abstract | ||
|---|---|---|
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. We then also provide explicit constructions of optimal codes which show that for certain parameters the new bound is sharp. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TIT.2022.3161613 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Locally repairable codes,Singleton-type bound | Journal | 68 |
Issue | ISSN | Citations |
8 | 0018-9448 | 1 |
PageRank | References | Authors |
0.35 | 18 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Han Cai | 1 | 92 | 7.41 |
| Cui-Ling Fan | 2 | 120 | 12.44 |
| Ying Miao | 3 | 491 | 43.85 |
| Moshe Schwartz | 4 | 345 | 35.86 |
| Xiaohu Tang | 5 | 1294 | 121.15 |