A distributed storage system (DSS) is one of the most vital components of a cloud computing
system used for storing and sharing big data among authorized users. A typical DSS …

Low‐density parity‐check (LDPC) codes from affine permutation matrices, called APM‐
LDPC codes, are a class of LDPC codes whose parity‐check matrices consist of zero …

Recently, Hao and Xia noted a connection between a class of binary locally repairable
codes (LRCs) with multiple repair groups and binary low-density parity-check (LDPC) codes …

Motivated by applications involving hot data, the notion of (r, t)-availability was introduced,
where a symbol is said to have (r, t)-availability if it can be reconstructed, respectively, from t …

Recently, some attentions have been focused on a class of low-density parity-check codes
from affine permutation matrices, called APM-LDPC codes, which have some advantages …

In this paper, a new method is given for counting cycles in the Tanner graph of a (Type-I)
quasi-cyclic (QC) low-density parity-check (LDPC) code which the complexity mainly is …

This paper considers the construction of fractional repetition (FR) codes with flexible storage
capacity and repair for distributed storage systems (DSSs). FR codes are the key to …

Recently, a class of low‐density parity‐check (LDPC) codes from affine permutation
matrices, called APM‐LDPC codes, have attracted because of some advantages rather than …

This paper is concerned with the construction of local parities for optimal locally repairable
codes (LRCs) with (r, t)-availability in distributed storage, where a symbol is said to have (r, t) …

Recently, Low Density Parity-Check (LDPC) codes based on Affine Permutation Matrices
(APM) drew lots of attention. Compared with the Quasi-Cyclic LDPC (QC-LDPC) codes …