In the literature, most of the known high-rate $(n, k) $ MDS array codes with the optimal
repair property only support a single repair degree (ie, the number of helper nodes …

In the literature, most of the known high-rate MDS array codes with the optimal repair
property only support a single repair degree (ie, the number of helper nodes contacted …

Recently, some high-rate maximum distance separable (MDS) array codes were designed
to optimally repair a single failed node by connecting all the surviving nodes. However, in …

An mx (k+ r) binary maximum distance separable (MDS) array code contains k information
columns and r parity columns with each entry being a bit such that any k out of k+ r columns …

Abundant high-rate minimum storage regenerating (MSR) codes have been reported in the
literature. However, most of them require contacting all the surviving nodes during a node …

High-rate minimum storage regenerating (MSR) codes are known to require a large sub-
packetization level, which can make meta-data management difficult and hinder …

An $(n, k) $ maximum distance separable (MDS) code has optimal repair access if the
minimum number of symbols accessed from $ d $ surviving nodes is achieved, where $ k+ …

An mx (k+ r) binary maximum distance separable (MDS) array code contains k information
columns and r parity columns with each entry being a bit, where any k out of k+ r columns …

Large-scale high code-rate maximum distance separable (MDS) codes are critical and
important in distributed storage systems that can provide high fault tolerance with extremely …

Efficient node repair is a crucial problem in erasure-code-based distributed storage systems.
An important metric for repair efficiency is the I/O cost which means the amount of data …