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 …
A family of optimal locally recoverable codes
A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the
encoding is a function of a small number (at most r) other symbols. We present a family of …
encoding is a function of a small number (at most r) other symbols. We present a family of …
Optimal locally repairable codes and connections to matroid theory
I Tamo, DS Papailiopoulos… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
Petabyte-scale distributed storage systems are currently transitioning to erasure codes to
achieve higher storage efficiency. Classical codes, such as Reed-Solomon (RS), are highly …
achieve higher storage efficiency. Classical codes, such as Reed-Solomon (RS), are highly …
Bounds on the parameters of locally recoverable codes
A locally recoverable code (LRC code) is a code over a finite alphabet, such that every
symbol in the encoding is a function of a small number of other symbols that form a …
symbol in the encoding is a function of a small number of other symbols that form a …
[LIVRE][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 …
Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes
U Martínez-Peñas… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Locally repairable codes (LRCs) are considered with equal or unequal localities, local
distances, and local field sizes. An explicit two-layer architecture with a sum-rank outer code …
distances, and local field sizes. An explicit two-layer architecture with a sum-rank outer code …
Codes in the sum-rank metric: Fundamentals and applications
U Martínez-Peñas, M Shehadeh… - … and Trends® in …, 2022 - nowpublishers.com
Codes in the sum-rank metric have attracted significant attention for their applications in
distributed storage systems, multishot network coding, streaming over erasure channels …
distributed storage systems, multishot network coding, streaming over erasure channels …
Rank-metric codes and their applications
The rank metric measures the distance between two matrices by the rank of their difference.
Codes designed for the rank metric have attracted considerable attention in recent years …
Codes designed for the rank metric have attracted considerable attention in recent years …
A construction of maximally recoverable codes with order-optimal field size
We construct maximally recoverable codes (corresponding to partial MDS codes) which are
based on linearized Reed-Solomon codes. The new codes have a smaller field size …
based on linearized Reed-Solomon codes. The new codes have a smaller field size …
Practical design considerations for wide locally recoverable codes (LRCs)
Most of the data in large-scale storage clusters is erasure coded. At exascale, optimizing
erasure codes for low storage overhead, efficient reconstruction, and easy deployment is of …
erasure codes for low storage overhead, efficient reconstruction, and easy deployment is of …