Name
Abstract | ||
|---|---|---|
Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. In an LRC code, any erased symbol of a codeword can be recovered by accessing only a small number of other symbols. For LRC codes over a small alphabet (such as binary), the optimal rate-distance trade-off is unknown. We pres... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2018.2800042 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Upper bound,Maintenance engineering,Parity check codes,Linear programming,Electronic mail,Error correction codes | Journal | 64 |
Issue | ISSN | Citations |
5 | 0018-9448 | 7 |
PageRank | References | Authors |
0.42 | 22 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abhishek Agarwal | 1 | 36 | 7.41 |
| Alexander Barg | 2 | 910 | 85.90 |
| Sihuang Hu | 3 | 30 | 4.03 |
| Arya Mazumdar | 4 | 307 | 41.81 |
| Itzhak Tamo | 5 | 548 | 36.05 |