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 …

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 …

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 …

With the rapid development of Industry 4.0, the data security of Industrial Internet of Things in
the Industry 4.0 environment has received widespread attention. Blockchain has the …

Locally recoverable codes (LRCs) were proposed for the recovery of data in distributed and
cloud storage systems about nine years ago. A lot of progress on the study of LRCs has …

In a paper by Guruswami et al., it was shown that the length n of a q-ary linear locally
recoverable code with distance d≥ 5 is upper bounded by O (dq 3). Thus, it is a challenging …

Repair locality has been an important metric in a distributed storage system (DSS). Erasure
codes with small locality are more popular in a DSS, which means fewer available nodes …

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 …

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 …