Low Complexity Bounds on a Class of Irregular LDPC Belief-Propagation Decoding Thresholds

This paper investigates about the usefulness of a recently published low complexity upper bound on beliefpropagation decoding thresholds for a class of irregular lowdensity parity-check (LDPC) codes. In particular, the class considered is characterized by variable node degree distributions λ(x) of minimum degree i1 >2: being, in this case, λ′(0) = λ2 = 0, this is useful to design LDPC codes presenting a linear minimum distance growth with the block length with probability 1, as shown in Di et al.'s 2006 paper. These codes unfortunately cannot reach capacity under iterative decoding, since the achievement of capacity requires λ2 ≠ 0. However, in this latter case, the block error probability might converge to a constant, as shown in the aforementioned paper. © 2020 University of Split, FESB.