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 …

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 …

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 code is said to be an r-local locally repairable code (LRC) if each of its coordinates can be
repaired by accessing at most r other coordinates. When some of the r coordinates are also …

Locally repairable codes (LRCs) are a class of codes designed for the local correction of
erasures. They have received considerable attention in recent years due to their …

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 …

Locally repairable codes (LRCs) are introduced in distributed storage systems due to their
low repair overhead. An LRC is called optimal if its minimum distance attains the Singleton …

A locally repairable code (LRC) is a linear code such that every code symbol can be
recovered by accessing a small number of other code symbols. In this paper, we study …

In a linear code, a code symbol is said to have locality r if it can be repaired by accessing at
most r other code symbols. For an (n, k, r) locally repairable codes (LRC), the most important …

This paper presents a construction for several families of optimal binary locally repairable
codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It …