$\varepsilon$-MSR Codes for Any Set of Helper Nodes
<|reference_start|>$\varepsilon$-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 amount of information from each of the helper nodes. However, MSR codes require large sub-packetization levels, which hinders their usefulness in practical settings. This led to the development of another class of MDS array codes called $\varepsilon$-MSR codes, for which the repair information downloaded from each helper node is at most a factor of $(1+\varepsilon)$ from the minimum amount for some $\varepsilon > 0$. The advantage of $\varepsilon$-MSR codes over MSR codes is their small sub-packetization levels. In previous constructions of epsilon-MSR codes, however, several specific nodes are required to participate in the repair of a failed node, which limits the performance of the code in cases where these nodes are not available. In this work, we present a construction of $\varepsilon$-MSR codes without this restriction. For a code with $n$ nodes, out of which $k$ store uncoded information, and for any number $d$ of helper nodes ($k\le d<n$), the repair of a failed node can be done by contacting any set of $d$ surviving nodes. Our construction utilizes group algebra techniques, and requires linear field size. We also generalize the construction to MDS array codes capable of repairing $h$ failed nodes using $d$ helper nodes with a slightly sub-optimal download from each helper node, for all $h \le r$ and $k \le d \le n-h$ simultaneously.<|reference_end|>
@article{ramkumar2024$\varepsilon$-msr,
    title={$\varepsilon$-MSR Codes for Any Set of Helper Nodes},
    author={Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo},
    journal={arXiv preprint arXiv:2408.16584},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.16584},
    primaryClass={cs.IT math.IT}
}