Constructing cooperative MSR codes with sub-packetization
We address the multi-node failure repair challenges for MDS array codes. Presently, two
primary models are employed for multi-node repairs: the centralized model where all failed …
primary models are employed for multi-node repairs: the centralized model where all failed …
Constructing Cooperative MSR Codes with Sub-Packetization
We address the multi-node failure repair challenges for MDS array codes. Presently, two
primary models are employed for multi-node repairs: the centralized model where all failed …
primary models are employed for multi-node repairs: the centralized model where all failed …
New Centralized MSR Codes With Small Sub-packetization
Y Zhang - arXiv preprint arXiv:2401.16866, 2024 - arxiv.org
Centralized repair refers to repairing $ h\geq 2$ node failures using $ d $ helper nodes in a
centralized way, where the repair bandwidth is counted by the total amount of data …
centralized way, where the repair bandwidth is counted by the total amount of data …
New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n))
M Ye - IEEE Transactions on Information Theory, 2020 - ieeexplore.ieee.org
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 …
cooperative model, where the repair bandwidth includes the amount of data exchanged …
Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth
Given any r and n, we present an explicit construction of high-rate maximum distance
separable (MDS) array codes that can optimally repair any d failed nodes from any h helper …
separable (MDS) array codes that can optimally repair any d failed nodes from any h helper …
Constructions of Binary MDS Array Codes with Optimal Cooperative Repair Bandwidth
Erasure codes are widely implemented in distributed storage systems to provide high fault
tolerance with small storage overhead. Maximum distance separable codes are an common …
tolerance with small storage overhead. Maximum distance separable codes are an common …
Explicit constructions of high-rate MDS array codes with optimal repair bandwidth
Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense
that they provide the maximum failure tolerance for a given number of parity nodes. Suppose …
that they provide the maximum failure tolerance for a given number of parity nodes. Suppose …
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization
The cooperative repair model is an available technology to deal with multiple node failures
in distributed storage systems. Recently, explicit constructions of cooperative MSR codes …
in distributed storage systems. Recently, explicit constructions of cooperative MSR codes …
Optimal repair/access MDS array codes with multiple repair degrees
Y Liu, J Li, XH Tang - arXiv preprint arXiv:2205.13446, 2022 - arxiv.org
In the literature, most of the known high-rate $(n, k) $ MDS array codes with the optimal
repair property only support a single repair degree (ie, the number of helper nodes …
repair property only support a single repair degree (ie, the number of helper nodes …
Triple-fault-tolerant binary MDS array codes with asymptotically optimal repair
Binary maximum distance separable (MDS) array codes are a special class of erasure
codes for distributed storage that not only provide fault tolerance with minimum storage …
codes for distributed storage that not only provide fault tolerance with minimum storage …