A Cascade Code Construction for (n, k, d) Distributed Storage Systems

Mehran Elyasi, Soheil Mohajer

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

2 Scopus citations

Abstract

A novel class of exact-repair regenerating codes is introduced for a distributed storage system with arbitrary parameters (n, k, d). The proposed construction is based on the optimum determinant codes for (n, k=d, d) systems. This construction yields an achievable trade-off between the storage and the repair bandwidth, consisting of k corner points, which meets the optimum trade-off at the MBR and MSR points, and improves all the previously known bounds for interior points. The sub-packetization level of the proposed code only depends on k and d, but not number of nodes n. Further, the required field size for the proposed code is Θ(n). We conjecture that the proposed codes can universally achieve the optimum trade-off.

Original languageEnglish (US)
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1241-1245
Number of pages5
ISBN (Print)9781538647806
DOIs
StatePublished - Aug 15 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: Jun 17 2018Jun 22 2018

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-June
ISSN (Print)2157-8095

Other

Other2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/TerritoryUnited States
CityVail
Period6/17/186/22/18

Bibliographical note

Funding Information:
This work is supported in part by the National Science Foundation under Grant CCF-1617884.

Fingerprint

Dive into the research topics of 'A Cascade Code Construction for (n, k, d) Distributed Storage Systems'. Together they form a unique fingerprint.

Cite this