Abstract
Cooperative regenerating codes are a class of codes that enable a data collector to reconstruct the original data by connecting to a subset of storage nodes, and also can repair multiple failed nodes by downloading data from the surviving nodes and exchanging data among the new nodes. In cooperative regenerating codes, there exists a tradeoff between the storage size of each node and repair-bandwidth. In this study, we propose new classes of cooperative regenerating codes based on correlation of information stored on nodes. We also consider relationships between each class of cooperative regenerating codes and storage size and repair-bandwidth.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 31-35 |
| Number of pages | 5 |
| ISBN (Electronic) | 9784885523090 |
| Publication status | Published - 2017 Feb 2 |
| Event | 3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States Duration: 2016 Oct 30 → 2016 Nov 2 |
Other
| Other | 3rd International Symposium on Information Theory and Its Applications, ISITA 2016 |
|---|---|
| Country/Territory | United States |
| City | Monterey |
| Period | 16/10/30 → 16/11/2 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Information Systems
- Signal Processing
- Library and Information Sciences