Two essential categories of LDPC codes that are more preferable to other types are quasi-
cyclic LDPC (QC-LDPC) codes and spatially coupled LDPC convolutional codes (SC-LDPC …

In this letter, for the first time, an edge-coloring technique is proposed to characterize a
certain elementary trapping set (ETS) and to obtain sufficient conditions to avoid small ETSs …

A circulant-permutation-based spatially-coupled (SC) code is constructed by partitioning the
circulant permutation matrices (CPMs) in the parity-check matrix of a block code into several …

Time-varying spatially coupled low-density parity-check (SC-LDPC) codes with very large
period are characterized by significantly better error rate performance and girth properties …

Time-varying spatially-coupled low-density parity-check convolutional codes (SC-LDPC-
CCs) exhibit excellent features, but their representation requires a very large number of …

There is a concept in graph theory known as a chord which has not been considered before
in relation to trapping sets of Tanner graphs. A chord of a cycle is an edge outside the cycle …

The error correction performance of low-density parity-check codes under iterative message-
passing decoding is degraded by the presence of certain harmful objects existing in their …

The error correction performance of low-density parity-check (LDPC) codes under iterative
message-passing decoding is degraded by the presence of certain harmful objects existing …

Controlling small size trapping sets and short cycles can result in LDPC codes with large
minimum distance d_\min. We prove that short cycles with a chord are the root of several …

The problem of finding bipartite (Tanner) graphs with given degree sequences that have
large girth and few short cycles is of great interest in many applications including …