Abstract
Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those of the other. In this paper, a novel connection between locally repairable codes and exact regenerating codes is established. Via this connection, locally repairable codes are interpreted as exact regenerating codes. Further, some of these codes are shown to perform better than time-sharing codes between minimum bandwidth regenerating and minimum storage regenerating codes.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory |
| Publisher | IEEE |
| Pages | 650-654 |
| Number of pages | 5 |
| Volume | 2016-August |
| ISBN (Electronic) | 978-1-5090-1806-2 |
| DOIs | |
| Publication status | Published - 10 Aug 2016 |
| MoE publication type | A4 Article in a conference publication |
| Event | IEEE International Symposium on Information Theory - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016 http://www.isit2016.org/ |
Publication series
| Name | IEEE International Symposium on Information Theory |
|---|---|
| Publisher | IEEE |
| ISSN (Print) | 2157-8095 |
| ISSN (Electronic) | 2157-8117 |
Conference
| Conference | IEEE International Symposium on Information Theory |
|---|---|
| Abbreviated title | ISIT |
| Country/Territory | Spain |
| City | Barcelona |
| Period | 10/07/2016 → 15/07/2016 |
| Internet address |