Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes
Takahiro Yoshida, Toshiyasu Matsushima · International Symposium on Information Theory and its Applications · 2016
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.