Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Doubly QC-LDPC Codes

Juane Li, Shu Lin, Khaled Abdel-Ghaffar, W.E. Ryan, Daniel J. Costello

Published Dec 1, 2016• 0 citations
Publisher
DOI
10.1017/9781316780152.009

Related papers

Doubly Generalized LDPC Codes(HISC2006)

Yige Wang, M.P.C. Fossorier

Information technology newsletter•May 16, 2006•0 citations

Doubly Generalized LDPC Codes over the AWGN Channel

Yige Wang, M.P.C. Fossorier

In this paper, the design of doubly generalized low-density parity-check (DGLDPC) codes is proposed. This approach generalizes the structure of LDPC codes at both check and variable nodes. The performance of DGLDPC codes over the AWGN channel is analyzed using EXIT charts. Combined with differential evolution optimization, this analysis provides thresholds for DGLDPC codes that are better than that of LDPC and GLDPC codes with the same maximum variable degree. These theoretical thresholds are verified via simulations. Furthermore DGLDPC codes exhibit a lower error floor compared with their LDPC and GLDPC counterparts.

IEEE Transactions on Communications•May 1, 2009•28 citations

Rate-Compatible QC-LDPC codes

Wataru Matsumoto, Rui Sakai, Hideo Yoshida

IEEE International Symposium on Information Theory (ISIT)•Nov 28, 2006•1 citation

Globally Coupled QC-LDPC Codes

Juane Li, Shu Lin, Khaled Abdel-Ghaffar +2 more

Cambridge University Press eBooks•Dec 1, 2016•9 citations

Ensemble weight enumerators for protograph-based doubly generalized LDPC codes

Yige Wang, Chung‐Li Wang, M.P.C. Fossorier

Protograph-based doubly generalized LDPC (DGLDPC) codes are explored in this paper. We extend (and in the process simplify) the technique for computing the ensemble weight enumerators of protograph-based LDPC and GLDPC codes to DGLDPC codes. We find that with careful design, protograph-based DGLDPC codes can have a better asymptotic growth rate of minimum distance than that of the protograph-based LDPC and GLDPC codes. Simulation results confirm that protograph-based DGLDPC codes have a low error floor.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•5 citations

Growth Rate of the Weight Distribution of Doubly-Generalized LDPC Codes: General Case and Efficient Evaluation

Mark F. Flanagan, Enrico Paolini, Marco Chiani +1 more

The growth rate of the weight distribution of irregular doubly-generalized LDPC (D-GLDPC) codes is developed and in the process, a new efficient numerical technique for its evaluation is presented. The solution involves simultaneous solution of a 4 × 4 system of polynomial equations. This represents the first efficient numerical technique for exact evaluation of the growth rate, even for LDPC codes. The technique is applied to two example D-GLDPC code ensembles.

arXiv:0907.4885•Globecom•Nov 1, 2009•8 citations
In this paper, the design of doubly generalized low-density parity-check (DGLDPC) codes is proposed. This approach generalizes the structure of LDPC codes at both check and variable nodes. The performance of DGLDPC codes over the AWGN channel is analyzed using EXIT charts. Combined with differential evolution optimization, this analysis provides thresholds for DGLDPC codes that are better than that of LDPC and GLDPC codes with the same maximum variable degree. These theoretical thresholds are verified via simulations. Furthermore DGLDPC codes exhibit a lower error floor compared with their LDPC and GLDPC counterparts.
Protograph-based doubly generalized LDPC (DGLDPC) codes are explored in this paper. We extend (and in the process simplify) the technique for computing the ensemble weight enumerators of protograph-based LDPC and GLDPC codes to DGLDPC codes. We find that with careful design, protograph-based DGLDPC codes can have a better asymptotic growth rate of minimum distance than that of the protograph-based LDPC and GLDPC codes. Simulation results confirm that protograph-based DGLDPC codes have a low error floor.