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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

On the Construction of Quasi-Cyclic Low-Density Parity-Check Codes Based on Girth

Toshihiko Okamura

Published Sep 1, 2004• 0 citations
OpenAlex

Related papers

Explicit Construction of Quantum Quasi-Cyclic Low-Density Parity-Check Codes with Column Weight 2 and Girth 12

河本大輝, Komoto, Daiki, Kenta Kasai

•Jan 1, 2025•0 citations

Hybrid construction of quasi-cyclic low-density parity-check codes with large girth based on euclidean geometries

Jun Li, Khan Md. Hashem Ali, Xueqin Jiang +1 more

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

International Conference on Information and Communication Technology Convergence (ICTC)•Nov 1, 2010•0 citations

On the construction of low-density parity-check codes with girth 10

Xiongfei Tao, Weizhong Liu, Xuecheng Zou

AEU - International Journal of Electronics and Communications•Jun 7, 2008•1 citation

Construction of girth‐eight quasi‐cyclic low‐density parity‐check codes with low encoding complexity

Ruyan Wang, Yong Li, Hui Zhao +2 more

A construction method for girth‐eight quasi‐cyclic low‐density parity‐check codes (QC‐LDPCs) with low encoding complexity is proposed in this study. To avoid short cycles and further improve the performance of the authors proposed codes, the greatest common divisor (GCD)‐based method is utilised to construct the information part with girth‐eight of the parity‐check matrix with systematic form. Furthermore, the quasi‐dual‐diagonal structure is adopted as the parity part of the parity‐check matrix for fast encoding, which not only maintains the parity‐check matrix with girth‐eight, but also efficiently decreases the encoding complexity of their proposed codes. Simulation results show that their proposed codes perform better than Mackay's codes and the QC‐LDPCs constructed by the GCD‐based method, and have comparable performance compared with progressive edge growth based QC‐LDPCs. Besides, their proposed codes have lower encoding complexity due to the property of fast encoding.

IET Communications•Jan 1, 2016•6 citations

Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth

Pinyi Ren, Qiang Yuan, Rui Wang +1 more

Science China Information Sciences•Feb 1, 2011•3 citations

Maximum-girth slope-based quasi-cyclic (2, k ≥5) low-density parity-check codes

Morteza Esmaeili, Mohammad Gholami

A class of maximum-girth geometrically structured regular (n, 2, k≥5) (column-weight 2 and row-weight k) quasi-cyclic low-density parity-check (LDPC) codes is presented. The method is based on cylinder graphs and the slope concept. It is shown that the maximum girth achieved by these codes is 12. A low-complexity algorithm producing all such maximum-girth LDPC codes is given. The shortest constructed code has a length of 105. The minimum length n of a regular (2, k) LDPC code with girth g=12 determined by the Gallager bound has been achieved by the constructed codes. From the perspective of performance these codes outperform the column-weight 2 LDPC codes constructed by the previously reported methods. These codes can be encoded using an erasure decoding process.

IET Communications•Nov 30, 2008•7 citations
A construction method for girth‐eight quasi‐cyclic low‐density parity‐check codes (QC‐LDPCs) with low encoding complexity is proposed in this study. To avoid short cycles and further improve the performance of the authors proposed codes, the greatest common divisor (GCD)‐based method is utilised to construct the information part with girth‐eight of the parity‐check matrix with systematic form. Furthermore, the quasi‐dual‐diagonal structure is adopted as the parity part of the parity‐check matrix for fast encoding, which not only maintains the parity‐check matrix with girth‐eight, but also efficiently decreases the encoding complexity of their proposed codes. Simulation results show that their proposed codes perform better than Mackay's codes and the QC‐LDPCs constructed by the GCD‐based method, and have comparable performance compared with progressive edge growth based QC‐LDPCs. Besides, their proposed codes have lower encoding complexity due to the property of fast encoding.
A class of maximum-girth geometrically structured regular (n, 2, k≥5) (column-weight 2 and row-weight k) quasi-cyclic low-density parity-check (LDPC) codes is presented. The method is based on cylinder graphs and the slope concept. It is shown that the maximum girth achieved by these codes is 12. A low-complexity algorithm producing all such maximum-girth LDPC codes is given. The shortest constructed code has a length of 105. The minimum length n of a regular (2, k) LDPC code with girth g=12 determined by the Gallager bound has been achieved by the constructed codes. From the perspective of performance these codes outperform the column-weight 2 LDPC codes constructed by the previously reported methods. These codes can be encoded using an erasure decoding process.