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) other symbols. We present a family of …

This paper studies the problem of information symbol availability in codes: we refer to a
systematic code as code with (r, t)-availability if every information (systematic) symbol can be …

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 …

In a locally recoverable or repairable code, any symbol of a codeword can be recovered by
reading only a small (constant) number of other symbols. The notion of local recoverability is …

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 …

A locally repairable code (LRC) with locality r allows for the recovery of any erased
codeword symbol using only r other codeword symbols. A Singleton-type bound dictates the …

Constructing locally repairable codes achieving Singleton-type bound (we call them optimal
codes in this paper) is a challenging task and has attracted great attention in the last few …

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 …

A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the
encoding is a function of a small number (at most r) of other symbols of the codeword. In this …

Locally repairable codes, or locally recoverable codes (LRC for short), are designed for
applications in distributed and cloud storage systems. Similar to classical block codes, there …