/cooperative-msr

cooperative msr code

Constructing $(h,k+1)$ cooperative MSR codes with sub-packetization $(h+1)2^{\lceil n/2 \rceil}$

Authors: Zihao Zhang, Guodong Li, Sihuang Hu

Abstract: 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 nodes are restored in a singular data center, and the cooperative model where failed nodes acquire data from auxiliary nodes and collaborate amongst themselves for the repair process. This paper primarily focuses on the cooperative model, and we provide explicit constructions of optimal MDS codes with $d=k+1$ helper nodes under this model. The sub-packetization level of our new codes is $(h+1)2^{\lceil n/2 \rceil}$ where $h$ is the number of failed nodes and $n$ is the code length. This improves upon recent constructions given by Liu et. al. (IEEE Transactions on Information Theory, Vol. 69, 2023).