Abstract
Regenerating codes are efficient methods for distributed storage in practical networks where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrary chosen storage nodes in the network. In this work we study the fundamental limits of required total repair bandwidth and the storage capacity of these codes under the assumption that i) both data reconstruction and repair are resilient to the presence of a certain number of erroneous nodes in the network and ii) the number of helper nodes in every repair is not fixed, but is a flexible parameter that can be selected during the run-time. We focus on the minimum repair bandwidth point in this work, propose the associated coding scheme to posses both these extra properties, and prove its optimality.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 235-239 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781509018062 |
| DOIs | |
| State | Published - Aug 10 2016 |
| Externally published | Yes |
| Event | 2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: Jul 10 2016 → Jul 15 2016 |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| Volume | 2016-August |
| ISSN (Print) | 2157-8095 |
Other
| Other | 2016 IEEE International Symposium on Information Theory, ISIT 2016 |
|---|---|
| Country/Territory | Spain |
| City | Barcelona |
| Period | 7/10/16 → 7/15/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.