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 language||English (US)|
|Title of host publication||2018 IEEE International Symposium on Information Theory, ISIT 2018|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|State||Published - Aug 15 2018|
|Event||2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States|
Duration: Jun 17 2018 → Jun 22 2018
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Other||2018 IEEE International Symposium on Information Theory, ISIT 2018|
|Period||6/17/18 → 6/22/18|
Bibliographical noteFunding Information:
This work is supported in part by the National Science Foundation under Grant CCF-1617884.