In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CHGLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set into super checks corresponding to a 2-error correcting component code. Specifically, we follow two main purposes to construct the check-hyb...

CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) where the constraint nodes (CNs) represent convolutional codes. This allows for efficient decoding in trellis with forward-backward algorithm, and strength component easily can be controlled by encoder memory without changing graph structure. In this letter, we extend CC-GLDPC introducing different types irregularity at ...

We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named bounded distance with combined reliability (iBDD-CR), enhances the conventional (iBDD) of PCs by exploiting some level soft information. In particular, iBDD-CR can be seen as modification iBDD where hard decisions row and column decoders are made based on estimate BDD outputs. estim...

In this paper, we propose the cycle-concentrating progressive edge growth (CC-PEG) algorithm for lifting protograph generalized low-density parity-check (GLDPC) codes. GLDPC codes, undoped variable nodes (VNs) that are not connected to constraint (GC) nodes more vulnerable channel errors than x...