Erasure coding for distributed storage: An overview
In a distributed storage system, code symbols are dispersed across space in nodes or
storage units as opposed to time. In settings such as that of a large data center, an important …
storage units as opposed to time. In settings such as that of a large data center, an important …
Repairing reed-solomon codes
V Guruswami, M Wootters - Proceedings of the forty-eighth annual ACM …, 2016 - dl.acm.org
A fundamental fact about polynomial interpolation is that k evaluations of a degree-(k-1)
polynomial f are sufficient to determine f. This is also necessary in a strong sense: given k-1 …
polynomial f are sufficient to determine f. This is also necessary in a strong sense: given k-1 …
Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization
An (n, k, l) maximum distance separable (MDS) array code of length n, dimension k= nr, and
subpacketization l is formed of l× n matrices over a finite field F, with every column of the …
subpacketization l is formed of l× n matrices over a finite field F, with every column of the …
[图书][B] Concise encyclopedia of coding theory
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Opening the chrysalis: On the real repair performance of {MSR} codes
Large distributed storage systems use erasure codes to reliably store data. Compared to
replication, erasure codes are capable of reducing storage overhead. However, repairing …
replication, erasure codes are capable of reducing storage overhead. However, repairing …
A piggybacking design framework for read-and download-efficient distributed storage codes
Erasure codes are being extensively deployed in distributed storage systems instead of
replication to achieve fault tolerance in a storage efficient manner. While traditional erasure …
replication to achieve fault tolerance in a storage efficient manner. While traditional erasure …
An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair
This paper presents an explicit construction for an $((n, k, d= n-1),(\alpha,\beta)) $
regenerating code over a field $\mathbb {F} _Q $ operating at the Minimum Storage …
regenerating code over a field $\mathbb {F} _Q $ operating at the Minimum Storage …
A generic transformation to enable optimal repair in MDS codes for distributed storage systems
We propose a generic transformation that can convert any nonbinary (n= k+ r, k) maximum
distance separable (MDS) code into another (n, k) MDS code over the same field such that …
distance separable (MDS) code into another (n, k) MDS code over the same field such that …
Explicit minimum storage regenerating codes
In distributed storage, a file is stored in a set of nodes and protected by erasure-correcting
codes. Regenerating code is a type of code with two properties: first, it can reconstruct the …
codes. Regenerating code is a type of code with two properties: first, it can reconstruct the …
A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes
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 …
can convert any non-binary (k+ r, k) MDS code into another (k+ r, k) MDS code with the …