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

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

Explicit Construction of QC-LDPC Codes Without Short Cycles via Shifting Dual Increasing Sequences

Guohua Zhang, Mei Li, Yi Fang

Published Sep 1, 2026• 0 citations
Publisher

Abstract

Explicit construction methods for Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes offer greater descriptive simplicity and stronger applicability than search-based methods. A column weight that is either too large or too small makes it difficult to simultaneously balance the waterfall and error floor regions of the decoding performance curve. Therefore, this paper proposes an explicit construction method for QC-LDPC codes with a column weight approximately equal to 4 via shifting dual increasing sequences. For any given row weight L, this method can directly construct a $4 \times L$ exponent matrix, where evenindexed rows are defined by deterministic mathematical formulas to form dual increasing sequences, and odd-indexed rows are generated by applying cyclic right-shift operations to the corresponding even-indexed rows. Theoretical analysis proves that when the circulant size $\boldsymbol{P}$ is not less than a specific lower bound, the proposed codes achieve a girth of 8. Simulation results demonstrate that the proposed codes outperform benchmark codes constructed using the horizontal symmetrical, column multipliers, and decrease-increase methods, while remaining comparable to product-like counterparts. Furthermore, when combined with the masking operation, their decoding performance is significantly improved compared to the original codes; when combined with the splitting and concatenation operation, the proposed codes outperform the 5G-NR code based on BG2 in the high signal-to-noise regime.

DOI
10.1109/pimrc69400.2026.11711944

Related papers

New Construction of QC-LDPC Codes Based on Full-Length Row-Multiplier

Ke Jia, Yu Qin, Mei Li

This paper proposes a new explicit construction method for quasi-cyclic (QC) low-density parity-check (LDPC) codes without 4-cycles and 6-cycles with large column weights. Two integer sequences entirely define the exponent matrix of the new method. The first sequence is an arithmetic sequence starting from 0 with a tolerance of 1, and the second sequence is a special sequence composed of integers that meet the constraint of the greatest common divisor (GCD). The existing explicit method can only provide a variety of row weight types with large circulant size. Compared with the recently proposed symmetric structure method based on computer search, the new explicit construction method has better decoding performance, extremely low description complexity, and does not require computer search.

IEEE International Conference on Communication Technology (ICCT)•Oct 18, 2024•0 citations

Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families

Hosung Park, Seokbeom Hong, Jong‐Seon No +1 more

For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.

arXiv:1211.3828•IEEE Transactions on Communications•Jul 16, 2013•33 citations

Dual-Diagonal QC-LDPC Codes Free of Small Cycles From GCD Framework via Negative Coefficients

Guohua Zhang, Mengjuan Lou, Aijing Sun +1 more

A novel class of dual-diagonal (DD) quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight is proposed. For the exponent matrix of such a DD-QC-LDPC code, the left sub-matrix is explicitly generated via new formulae which are motivated by a search algorithm based on the greatest-common-divisor (GCD) framework and a new strategy allowing negative coefficients. The right sub-matrix (DD matrix) is designed by modifying the existing DD matrix while preserving the simple encoding property directly through the parity-check matrix. Performance simulations indicate that the proposed DD-QC-LDPC codes significantly outperform several existing counterparts with or without DD structure. Unlike existing formulae which involve only non-negative coefficients, the new formulae motivated by proposed search algorithm allow for negative coefficients, which lead to significantly improved lower bounds on circulant sizes for column weights from five to seven. As a result, the new DD-QC-LDPC codes not only enable simple encoding and low description complexity, but also possess consecutive and reasonably small circulant sizes, flexible sizes for exponent matrices as well as good decoding performance.

IEEE Communications Letters•Oct 4, 2024•5 citations

(7,K) GIRTH-8 QC-LDPC CODES WITH AN EXPLICIT CONSTRUCTION

M. Majdzadeh, Mohammad Gholami, Gh. Raeisi

Recently, for each row weight $K$ and column-weight $J$, $3le J< K$, several classes of $(J,K)$ quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth 8 have been constructed explicitly such that their corresponding lower-bounds on the size of circulant permutation matrices (CPMs) have been considered small as possible. In this paper, for $J=7$, a class of $(7,K)$ QC-LDPC codes with girth 8 is generated by an explicit method such that the lower-bounds of the constructed codes remarkably are better than the state-of-the-art bound $(K-1)(K^2+K)+1$.

Journal of Algebraic Systems•Jan 1, 2022•2 citations

Flexible Construction of High-Girth QC-LDPC Codes

Gabofetswe Malema

This article presents a highly flexible method for constructing high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes. The proposed algorithm constructs a Tanner graph formed by connecting groups of rows (check nodes) and columns (variable nodes) of the constructed code. To obtain a sub-matrix structure, rows and columns are divided into groups of equal sizes. Rows and columns in a group are connected in their numerical (positional) order to obtain a cyclic structure. Connected rows and columns must satisfy the desired minimum cycle length. We present conditions that guarantee desired girths. The proposed algorithm is by far more flexible in constructing a wide range (rates and lengths) of regular and irregular QC-LDPC codes compared to existing methods. The algorithm, which has linear complexity with respect to the number of rows or columns, provides an easy and fast way to construct QC-LDPC codes. Constructed codes show good bit error rate performances.

International journal of computer science and applications•Aug 1, 2012•2 citations

QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns

Mohammad Hesam Tadayon, Mohammad Mohammadi

In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.

International Journal of Information & Communication Technology Research•Jun 15, 2016•0 citations
Explicit construction methods for Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes offer greater descriptive simplicity and stronger applicability than search-based methods. A column weight that is either too large or too small makes it difficult to simultaneously balance the waterfall and error floor regions of the decoding performance curve. Therefore, this paper proposes an explicit construction method for QC-LDPC codes with a column weight approximately equal to 4 via shifting dual increasing sequences. For any given row weight L, this method can directly construct a 4×L4 \times L4×L exponent matrix, where evenindexed rows are defined by deterministic mathematical formulas to form dual increasing sequences, and odd-indexed rows are generated by applying cyclic right-shift operations to the corresponding even-indexed rows. Theoretical analysis proves that when the circulant size P\boldsymbol{P}P is not less than a specific lower bound, the proposed codes achieve a girth of 8. Simulation results demonstrate that the proposed codes outperform benchmark codes constructed using the horizontal symmetrical, column multipliers, and decrease-increase methods, while remaining comparable to product-like counterparts. Furthermore, when combined with the masking operation, their decoding performance is significantly improved compared to the original codes; when combined with the splitting and concatenation operation, the proposed codes outperform the 5G-NR code based on BG2 in the high signal-to-noise regime.
This paper proposes a new explicit construction method for quasi-cyclic (QC) low-density parity-check (LDPC) codes without 4-cycles and 6-cycles with large column weights. Two integer sequences entirely define the exponent matrix of the new method. The first sequence is an arithmetic sequence starting from 0 with a tolerance of 1, and the second sequence is a special sequence composed of integers that meet the constraint of the greatest common divisor (GCD). The existing explicit method can only provide a variety of row weight types with large circulant size. Compared with the recently proposed symmetric structure method based on computer search, the new explicit construction method has better decoding performance, extremely low description complexity, and does not require computer search.
For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.
A novel class of dual-diagonal (DD) quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight is proposed. For the exponent matrix of such a DD-QC-LDPC code, the left sub-matrix is explicitly generated via new formulae which are motivated by a search algorithm based on the greatest-common-divisor (GCD) framework and a new strategy allowing negative coefficients. The right sub-matrix (DD matrix) is designed by modifying the existing DD matrix while preserving the simple encoding property directly through the parity-check matrix. Performance simulations indicate that the proposed DD-QC-LDPC codes significantly outperform several existing counterparts with or without DD structure. Unlike existing formulae which involve only non-negative coefficients, the new formulae motivated by proposed search algorithm allow for negative coefficients, which lead to significantly improved lower bounds on circulant sizes for column weights from five to seven. As a result, the new DD-QC-LDPC codes not only enable simple encoding and low description complexity, but also possess consecutive and reasonably small circulant sizes, flexible sizes for exponent matrices as well as good decoding performance.
Recently, for each row weight KKK and column-weight JJJ, 3leJ<K3le J< K3leJ<K, several classes of (J,K)(J,K)(J,K) quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth 8 have been constructed explicitly such that their corresponding lower-bounds on the size of circulant permutation matrices (CPMs) have been considered small as possible. In this paper, for J=7J=7J=7, a class of (7,K)(7,K)(7,K) QC-LDPC codes with girth 8 is generated by an explicit method such that the lower-bounds of the constructed codes remarkably are better than the state-of-the-art bound (K−1)(K2+K)+1(K-1)(K^2+K)+1(K−1)(K2+K)+1.
This article presents a highly flexible method for constructing high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes. The proposed algorithm constructs a Tanner graph formed by connecting groups of rows (check nodes) and columns (variable nodes) of the constructed code. To obtain a sub-matrix structure, rows and columns are divided into groups of equal sizes. Rows and columns in a group are connected in their numerical (positional) order to obtain a cyclic structure. Connected rows and columns must satisfy the desired minimum cycle length. We present conditions that guarantee desired girths. The proposed algorithm is by far more flexible in constructing a wide range (rates and lengths) of regular and irregular QC-LDPC codes compared to existing methods. The algorithm, which has linear complexity with respect to the number of rows or columns, provides an easy and fast way to construct QC-LDPC codes. Constructed codes show good bit error rate performances.
In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.