Regenerating codes with generalized conditions of reconstruction and regeneration

Akira Kamatsuka, Yuta Azuma, Takahiro Yoshida, Toshiyasu Matsushima

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages41-45
Number of pages5
ISBN (Electronic)9784885523090
Publication statusPublished - 2017 Feb 2
Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: 2016 Oct 302016 Nov 2

Other

Other3rd International Symposium on Information Theory and Its Applications, ISITA 2016
CountryUnited States
CityMonterey
Period16/10/3016/11/2

Fingerprint

reconstruction
Integer programming
programming

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Signal Processing
  • Library and Information Sciences

Cite this

Kamatsuka, A., Azuma, Y., Yoshida, T., & Matsushima, T. (2017). Regenerating codes with generalized conditions of reconstruction and regeneration. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 41-45). [7840382] Institute of Electrical and Electronics Engineers Inc..

Regenerating codes with generalized conditions of reconstruction and regeneration. / Kamatsuka, Akira; Azuma, Yuta; Yoshida, Takahiro; Matsushima, Toshiyasu.

Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 41-45 7840382.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kamatsuka, A, Azuma, Y, Yoshida, T & Matsushima, T 2017, Regenerating codes with generalized conditions of reconstruction and regeneration. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840382, Institute of Electrical and Electronics Engineers Inc., pp. 41-45, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 16/10/30.
Kamatsuka A, Azuma Y, Yoshida T, Matsushima T. Regenerating codes with generalized conditions of reconstruction and regeneration. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 41-45. 7840382
Kamatsuka, Akira ; Azuma, Yuta ; Yoshida, Takahiro ; Matsushima, Toshiyasu. / Regenerating codes with generalized conditions of reconstruction and regeneration. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 41-45
@inproceedings{97d2b8588dfb4010af4b46ed18202af5,
title = "Regenerating codes with generalized conditions of reconstruction and regeneration",
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.",
author = "Akira Kamatsuka and Yuta Azuma and Takahiro Yoshida and Toshiyasu Matsushima",
year = "2017",
month = "2",
day = "2",
language = "English",
pages = "41--45",
booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Regenerating codes with generalized conditions of reconstruction and regeneration

AU - Kamatsuka, Akira

AU - Azuma, Yuta

AU - Yoshida, Takahiro

AU - Matsushima, Toshiyasu

PY - 2017/2/2

Y1 - 2017/2/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85015149078&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015149078&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85015149078

SP - 41

EP - 45

BT - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -