In this paper, we have developed several concepts such as the tree concept, short cycle concept and group shuffling of a propagation to decrypt low-density parity-check (LDPC) codes. Thus, proposed an algorithm based on where probability occurrence takes exponential form factor appearance belief propagation-group shuffled (EFAP-GSBP). This is used for wireless communication applications by prov...

Low-density parity-check (LDPC) codes, invented by Gallager [2], who described and analyzed a block variant of the codes, arouse great interest of researchers. These codes are widely used in practice since they can be decoded by using relatively simple iterative decoding algorithms. Several modifications of these codes are known, in particular, generalized LDPC codes [3]. In contrast to Gallage...

Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to in...