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 …

Erasure coding is a low-cost redundancy mechanism for distributed storage systems by
storing stripes of data and parity chunks. Wide stripes are recently proposed to suppress the …

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 …

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 …

Codes in the sum-rank metric have attracted significant attention for their applications in
distributed storage systems, multishot network coding, streaming over erasure channels …

In this paper, locally repairable codes which have optimal minimum Hamming distance with
respect to the bound presented by Prakash et al. are considered. New upper bounds on the …

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 …

As an important coding scheme in modern distributed storage systems, locally repairable
codes (LRCs) have attracted a lot of attentions from perspectives of both practical …

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 …

Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the
codeword without having to access each of the remaining coordinates. A subfamily of LRC …