抄録
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.
本文言語 | English |
---|---|
ホスト出版物のタイトル | Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 |
出版社 | Institute of Electrical and Electronics Engineers Inc. |
ページ | 41-45 |
ページ数 | 5 |
ISBN(電子版) | 9784885523090 |
出版ステータス | Published - 2017 2月 2 |
イベント | 3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States 継続期間: 2016 10月 30 → 2016 11月 2 |
Other
Other | 3rd International Symposium on Information Theory and Its Applications, ISITA 2016 |
---|---|
国/地域 | United States |
City | Monterey |
Period | 16/10/30 → 16/11/2 |
ASJC Scopus subject areas
- コンピュータ ネットワークおよび通信
- ハードウェアとアーキテクチャ
- 情報システム
- 信号処理
- 図書館情報学