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 …

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 …

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 …

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 …

The ith coordinate of an [n, k] code is said to have locality r and availability t if there exist t
disjoint groups, each containing at most r other coordinates that can together recover the …

This paper considers a distributed storage system, where multiple storage nodes can be
reconstructed simultaneously at a centralized location. This centralized multi-node repair …

Locally recoverable (LRC) codes have recently been a focus point of research in coding
theory due to their theoretical appeal and applications in distributed storage systems. In an …

The traditional means of ensuring reliability in data storage is to store multiple copies of the
same file in different storage units. Such a replication strategy is clearly inefficient in terms of …

Two related families of codes are studied: batch codes and codes for private information
retrieval. These two families can be viewed as natural generalizations of locally repairable …