Abstract
As a distributed storage system with regenerating function of failed nodes, regenerating codes have been studied recently. In a [n, k, d]-regenerating codes framework, a message can be reconstructed from any subsets of k nodes out of n nodes and any failed nodes can be repaired from any subsets of d nodes out of (n - 1) nodes. The conditions of the reconstruction and regeneration can be generalized. In this paper, we propose the regenerating codes with generalized conditions and derive their optimal constructing algorithm under the multiple assignment map construction framework. The optimal codes of the framework are obtained by solving integer programming problems in a similar way of generalized secret sharing scheme's construction based on a multiple assignment map.
| 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 | 41-45 |
| 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