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 …
Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes
AS Rawat, OO Koyluoglu… - 2016 Information Theory …, 2016 - ieeexplore.ieee.org
This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient
repair of a single node. Such MDS codes are also referred to as the minimum storage …
repair of a single node. Such MDS codes are also referred to as the minimum storage …
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 …
Linear exact-repair construction of hybrid MSR codes in distributed storage systems
S Liang, C Yuan, H Kan - IEEE communications letters, 2014 - ieeexplore.ieee.org
An [n, k, d]-hybrid minimum storage regenerating (HMSR) codes is one class of minimum
storage regenerating (MSR) codes where each storage node stores two symbols in a …
storage regenerating (MSR) codes where each storage node stores two symbols in a …
Minimum storage regenerating codes for all parameters
Regenerating codes for distributed storage have attracted much research interest in the past
decade. Such codes trade the bandwidth needed to repair a failed node with the overall …
decade. Such codes trade the bandwidth needed to repair a failed node with the overall …
A new repair strategy for the Hadamard minimum storage regenerating codes for distributed storage systems
The newly presented (k+ m, k) Hadamard minimum storage regenerating (MSR) codes are a
class of high rate storage codes with optimal repair property for single node failure. In this …
class of high rate storage codes with optimal repair property for single node failure. In this …
Construction of one special minimum storage regenerating code when α=2
ST Liang, WJ Liang, HB Kan - Science China Information Sciences, 2015 - Springer
Regenerating codes is one class of erasure codes for distributed storage. A [n, k, d, α, β]
regenerating code can recover the original message from any k out of n distributed storage …
regenerating code can recover the original message from any k out of n distributed storage …
Minimum storage regenerating codes for all parameters
Regenerating codes for distributed storage have attracted much research interest in the past
decade. Such codes trade the bandwidth needed to repair a failed node with the overall …
decade. Such codes trade the bandwidth needed to repair a failed node with the overall …
∊-MSR codes with small sub-packetization
Minimum storage regenerating (MSR) codes form a special class of maximum distance
separable (MDS) codes by providing mechanisms for exact regeneration of a single code …
separable (MDS) codes by providing mechanisms for exact regeneration of a single code …
Exact-MSR Codes for Distributed Storage with Low Repair Complexity
In this paper, we propose two new constructions of exact-repair minimum storage
regenerating (exact-MSR) codes. For both constructions, the encoded symbols are obtained …
regenerating (exact-MSR) codes. For both constructions, the encoded symbols are obtained …