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+ …

We propose a generic transformation on maximum distance separable (MDS) codes, which
can convert any non-binary (k+ r, k) MDS code into another (k+ r, k) MDS code with the …

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 …

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 …

For high-rate maximum distance separable (MDS) codes, most early constructions can only
optimally repair all the systematic nodes but not for all the parity nodes initially. Fortunately …

An (n, k) maximum distance separable (MDS) code encodes kα data symbols into nα
symbols that are stored in n nodes with α symbols each, such that the kα data symbols can …

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 …

An (n, k, l) MDS code of length n, dimension k, and sub-packetization l over a finite field F is
a set of n column vectors of length l over F with the property that any k vectors can recover …

In last ISIT, we reported a generic transformation on maximum distance separable (MDS)
codes, which can convert any non-binary (k+ r, k) MDS code into another (k+ r, k) MDS code …

Binary maximum distance separable (MDS) array codes are a special class of erasure
codes for distributed storage that not only provide fault tolerance with minimum storage …