Analysis of the relation between properties of LDPC codes and the tanner graph

The error-correcting capabilities of low-complexity decoded H-LDPC code as irregular LDPC code

“…In this paper for the first time we obtained the lower-bound on the guaranteed corrected errors fraction for H-LDPC code under the second decoding algorithm. Numerical results, represented at the end of the paper, for the lower-bound, obtained in this paper for H-LDPC code under the second decoding algorithm, significantly exceed the numerical results for the best known lower-bounds, obtained previously in [12], [13] for H-LDPC code under the first decoding algorithm.…”

“…Let us consider the first decoding algorithm A, proposed in [12], [13]. This algorithm uses the properties of the constituent Hamming code.…”

“…Then in [12], [13] a new lower bound for generalized regular LDPC codes was obtained. It was shown that numerical results of the lower bound [12], [13] for H-LDPC codes exceed similar results of the previously known best lower-bounds on the error correcting capabilities of H-LDPC codes [11].…”

“…This work was inspired partly by [14] and partly by [13]. In this work we consider the H-LDPC code and two different iterative hard-decision decoding algorithms.…”

“…The first decoding algorithm uses the properties of the constituent Hamming code. The lower-bound on the guaranteed corrected errors fraction for the H-LDPC codes under this decoding algorithm was obtained in [12], [13]. The second decoding algorithm considers H-LDPC as the irregular LDPC code and uses well-known majority decoding algorithm.…”