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 …

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 …

Locally repairable codes have become a key instrument in large-scale distributed storage
systems. This paper focuses on the construction of locally repairable codes with-locality that …

A block code is called a locally recoverable code (LRC for short) with-locality, if subject to
any erasure failures, every symbol in the encoding can still be recovered by accessing at …

In classical coding theory, it is common to construct new codes via propagation rules. There
are various propagation rules to construct classical block codes. However, propagation rules …

Locally recoverable codes play a crucial role in distributed storage systems. Many studies
have only focused on the constructions of optimal locally recoverable codes with regard to …

Being part of distributed storage systems, locally repairable codes (LRCs) have drawn great
attention in the past years. Inspired by a recent construction of optimal LRCs-based on cyclic …

An (r, δ)-locally repairable code ((r, δ)-LRC for short) was introduced by Prakash et al.[14] for
tolerating multiple failed nodes in distributed storage systems, which was a generalization of …

Locally repairable codes with hierarchical locality (H-LRCs) are designed to correct different
numbers of erasures, which play a crucial role in large-scale distributed storage systems. In …

Locally repairable codes (LRCs) and codes with hierarchical locality (H-LRCs) have a great
significance due to their applications in distributed storage systems. Constructing LRCs or H …