Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes

Takahiro Yoshida, Toshiyasu Matsushima

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

    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 languageEnglish
    Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages31-35
    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

    coding
    Repair
    efficiency
    Bandwidth

    ASJC Scopus subject areas

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

    Cite this

    Yoshida, T., & Matsushima, T. (2017). Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 31-35). [7840380] Institute of Electrical and Electronics Engineers Inc..

    Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes. / 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. 31-35 7840380.

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

    Yoshida, T & Matsushima, T 2017, Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840380, Institute of Electrical and Electronics Engineers Inc., pp. 31-35, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 16/10/30.
    Yoshida T, Matsushima T. Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 31-35. 7840380
    Yoshida, Takahiro ; Matsushima, Toshiyasu. / Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 31-35
    @inproceedings{8a92fb6a9ec0474aa93f659e339b2798,
    title = "Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes",
    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.",
    author = "Takahiro Yoshida and Toshiyasu Matsushima",
    year = "2017",
    month = "2",
    day = "2",
    language = "English",
    pages = "31--35",
    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 - Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes

    AU - Yoshida, Takahiro

    AU - Matsushima, Toshiyasu

    PY - 2017/2/2

    Y1 - 2017/2/2

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

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

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

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

    M3 - Conference contribution

    AN - SCOPUS:85015154262

    SP - 31

    EP - 35

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

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -