Abstract
In this paper, we provide explicit constructions for a class of exact-repair regenerating codes that possess a layered structure. These regenerating codes correspond to interior points on the storage-repair-bandwidth tradeoff where the cut-set bound of network coding is known to be not achievable under exact repair. The codes presented in this paper compare very well in comparison to schemes that employ space-sharing between MSR and MBR points, and come closest of all-known explicit constructions to interior points of the tradeoff. The codes can be constructed for a wide range of parameters, are high-rate, can repair multiple nodes simultaneously and no computation at helper nodes is required to repair a failed node. We also construct optimal codes with locality in which the local codes are layered regenerating codes.
| Original language | English |
|---|---|
| Title of host publication | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |
| Pages | 1611-1615 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2013 |
| Externally published | Yes |
| Event | IEEE International Symposium on Information Theory 2013 - Istanbul, Türkiye Duration: 7 Jul 2013 → 12 Jul 2013 http://www.itsoc.org/news-events/upcoming-events/isit-203 https://ieeexplore.ieee.org/xpl/conhome/6597029/proceeding (Proceedings) |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| ISSN (Print) | 2157-8095 |
Conference
| Conference | IEEE International Symposium on Information Theory 2013 |
|---|---|
| Abbreviated title | ISIT 2013 |
| Country/Territory | Türkiye |
| City | Istanbul |
| Period | 7/07/13 → 12/07/13 |
| Internet address |