A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization

DOI10.1109/TIT.2023.3234273MaRDI QIDQ6197461zbMATH OpenFDO

Authors Yajuan Liu, Han Cai, Xiaohu Tang

Publication date 19 March 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2201.06231

zbMATH Keywords

cooperative repair MDS codes optimal repair bandwidth perfect codes sub-packetization

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Abstract: Cooperative repair model is an available technology to deal with multiple node failures in distributed storage systems. Recently, explicit constructions of cooperative MSR codes were given by Ye (IEEE Transactions on Information Theory, 2020) with sub-packetization level

(d - k + h) (d - k + 1)^{n}

. Specifically, the sub-packetization level is

(h + 1) 2^{n}

when

d = k + 1

. In this paper, we propose a new cooperative repair scheme by means of the inter-instance and intra-instance pairing inherited from the perfect code which reduces the sub-packetization to

2^{n}

when

(h + 1) | 2^{n}

and

(2 e l l + 1) 2^{n}

when

h + 1 = (2 e l l + 1) 2^{m}

for

m g e 0

,

e l l g e 1

with

d = k + 1

helper nodes. That is to say, the sub-packetization is

h + 1

times or

2^{m}

times less than Ye's. It turned out to be the best result so far known.

Cited in

(1)

New centralized multi-node repair schemes for distributed storage

This page was built for publication: A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197461)