A fundamental issue in blockchain systems is their scalability in terms of data storage,
computation, communication, and security. To resolve this issue, a promising research …

Codes are widely used in many engineering applications to offer robustness against noise.
In large-scale systems, there are several types of noise that can affect the performance of …

Distributed storage systems for large clusters typically use replication to provide reliability.
Recently, erasure codes have been used to reduce the large storage overhead of three …

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 …

Distributed storage systems for large-scale applications typically use replication for
reliability. Recently, erasure codes were used to reduce the large storage overhead, while …

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 …

We design flexible schemes to explore the tradeoffs between storage space and access
efficiency in reliable data storage systems. Aiming at this goal, two new classes of erasure …

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 …

Regenerating codes and codes with locality are two coding schemes that have recently
been proposed, which in addition to ensuring data collection and reliability, also enable …

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 …