An array code has k information coordinates and parity coordinates, where each coordinate
is a vector in for some finite field. An MDS array code has the additional property that any k …

Wang et al.(IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an
explicit construction of an Minimum Storage Regenerating (MSR) code with 2 parity 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 …

We derive a lower bound on the amount of information accessed to repair failed nodes
within a single rack from any number of helper racks in the rack-aware storage model that …

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 …

In distributed storage systems, data are stored across multiple storage nodes which are
unreliable and prone to failure. While erasure coding is more efficient than simple replication …

Maximum distance separable (MDS) codes are commonly deployed in distributed storage
systems as they provide the maximum failure tolerance for some given redundancy. The …

Modern data centers use erasure codes to provide high storage efficiency and fault
tolerance. Reed–Solomon code is commonly deployed in large-scale distributed storage …

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 …

Wang et al.(IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an
explicit construction of an (n= k+ 2, k) Minimum Storage Regenerating (MSR) code with 2 …