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 …
A New Centralized Multi-Node Repair Scheme of MSR codes with Error-Correcting Capability
S Li, M Gadouleau, J Wang, D Zheng - arXiv preprint arXiv:2309.15668, 2023 - arxiv.org
Minimum storage regenerating (MSR) codes, with the MDS property and the optimal repair
bandwidth, are widely used in distributed storage systems (DSS) for data recovery. In this …
bandwidth, are widely used in distributed storage systems (DSS) for data recovery. In this …
On lower bounds on sub-packetization level of MSR codes and on the structure of optimal-access MSR codes achieving the bound
We present two lower bounds on sub-packetization level $\alpha $ of MSR codes with
parameters $(n, k, d= n-1,\alpha) $ where $ n $ is the block length, $ k $ dimension, $ d …
parameters $(n, k, d= n-1,\alpha) $ where $ n $ is the block length, $ k $ dimension, $ d …
Constructing MSR codes with subpacketization 2n/3 for k + 1 helper nodes
Wang et al.(IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an
explicit construction of an (n= k+ 2, k) Minimum Storage Regenerating (MSR) code with 2 …
explicit construction of an (n= k+ 2, k) Minimum Storage Regenerating (MSR) code with 2 …
A high-rate MSR code with polynomial sub-packetization level
B Sasidharan, GK Agarwal… - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
We present a high-rate (n, k, d= n− 1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
L Wang, Z Zhang, S Hu - arXiv preprint arXiv:2501.12984, 2025 - arxiv.org
We establish lower bounds on the sub-packetization of optimal-access MSR codes in the
context of multiple-node failures. These bounds generalize the tight bounds for single-node …
context of multiple-node failures. These bounds generalize the tight bounds for single-node …
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 …
-MSR Codes for Any Set of Helper Nodes
Minimum storage regenerating (MSR) codes are a class of maximum distance separable
(MDS) array codes capable of repairing any single failed node by downloading the minimum …
(MDS) array codes capable of repairing any single failed node by downloading the minimum …
Constructing MSR Codes With Subpacketization 2n/3 for k + 1 Helper Nodes
Wang et al.(IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an
explicit construction of an Minimum Storage Regenerating (MSR) code with 2 parity nodes …
explicit construction of an Minimum Storage Regenerating (MSR) code with 2 parity nodes …