In this article, we design finite-length irregular protograph-based quasi-cyclic (QC) low-
density parity-check (LDPC) codes with good waterfall performance and low error floor. To …

In this paper, we propose a design technique for the construction of variable-regular time-
invariant spatially-coupled low-density parity-check (SC-LDPC) codes with small constraint …

We propose a systematic design of protograph-based quasi-cyclic (QC) low-density parity-
check (LDPC) codes with low error floor. We first characterize the trapping sets of such …

Non-binary (NB) low-density parity-check (LDPC) codes are graph-based codes that are
increasingly being considered as a powerful error correction tool for modern dense storage …

The linear state-space model is a well-known code-independent method to estimate the
contribution of a trapping set (TS) structure to the error floor of low-density parity-check …

The performance of low-density parity-check (LDPC) codes at high signal-to-noise ratios
(SNRs) is known to be limited by the presence of certain sub-graphs that exist in the Tanner …

In this paper, we analyze the error floor of quasi-cyclic (QC) low-density parity-check (LDPC)
codes decoded by the sum-product algorithm (SPA) with row layered message-passing …

Spatially coupled (SC)-low-density parity-check (LDPC) codes are known to have
outstanding error-correction performance and low decoding latency, which make them an …

One of the key weaknesses of low-density parity-check (LDPC) codes is the error floor that
they typically exhibit at high signal-to-noise ratios (SNRs). Such an error floor is usually …

The performance of low-density parity-check (LDPC) codes in the error floor region is closely
related to some substructures of the code's Tanner graph, collectively referred to as trapping …