New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n))

DOI10.1109/TIT.2020.3008342zbMATH Open1457.94077arXiv1911.12525OpenAlexW3041500673MaRDI QIDQ5138907FDOQ5138907

Authors: Min Ye 

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We consider the problem of multiple-node repair in distributed storage systems under the cooperative model, where the repair bandwidth includes the amount of data exchanged between any two different storage nodes. Recently, explicit constructions of MDS codes with optimal cooperative repair bandwidth for all possible parameters were given by Ye and Barg (IEEE Transactions on Information Theory, 2019). The node size (or sub-packetization) in this construction scales as $exp(Theta(n^h))$, where $h$ is the number of failed nodes and $n$ is the code length. In this paper, we give new explicit constructions of optimal MDS codes for all possible parameters under the cooperative model, and the node size of our new constructions only scales as $exp(O(n))$ for any number of failed nodes. Furthermore, it is known that any optimal MDS code under the cooperative model (including, in particular, our new code construction) also achieves optimal repair bandwidth under the centralized model, where the amount of data exchanged between failed nodes is not included in the repair bandwidth. We further show that the node size of our new construction is also much smaller than that of the best known MDS code constructions for the centralized model.

Full work available at URL: https://arxiv.org/abs/1911.12525

zbMATH Keywords

distributed storage systemscooperative modelconstructions of optimal MDS codesmultiple-node repair

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (1)

• A class of minimum storage cooperative regenerating codes with low access property

This page was built for publication: New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n))

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138907)