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

arXiv:2404.14962 · IEEE International Symposium on Information Theory (ISIT)

Short Regular Girth-8 QC-LDPC Codes from Exponent Matrices with Vertical Symmetry

Guohua Zhang, Aijing Sun, Ling Liu, Yi Fang

Published Jul 7, 2024• 7 citations
arXivHTMLPDF

Abstract

To address the challenge of constructing short girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes, a novel construction framework based on vertical symmetry (VS) is proposed. Basic properties of the VS structure are presented. With the aid of these properties, existing explicit constructions for column weights from three to five which can be transformed into the VS structure are sorted out. Then two novel explicit constructions with the VS structure which guarantee short codes are presented for column weights of three and six. Moreover, an efficient search-based method is also proposed to find short codes with the VS structure. Compared with the state-of-the-art benchmarks, both the explicit constructions and the search-based method presented in this paper can provide shorter codes for most cases. Simulation results show that the new shorter codes can perform almost the same as or better than the longer existing counterparts. Thus, the new shorter codes can fit better with the low-latency requirement for modern communication systems.

DOI
10.1109/isit57864.2024.10619229

Related papers

Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes

Alireza Tasdighi, Amir H. Banihashemi, Mohammad‐Reza Sadeghi

In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions assume symmetries in the structure of the parity-check matrix and employ a greedy exhaustive search algorithm to find the permutation shifts of the CPMs. As a result of symmetries, the new codes have a more compact representation compared with their counterparts. In majority of cases, also, they achieve the girth 8 at a shorter block length for the same degree distribution (code rate). Deterministic (explicit) constructions are also presented to expand the proposed parity-check matrices to larger block lengths and higher rates. The proposed long high-rate codes are often substantially shorter than regular girth-8 QC-LDPC codes of similar rate in the literature. Simulation results demonstrate that the proposed symmetric codes have competitive performance in comparison with similar existing QC-LDPC codes that lack symmetry.

IEEE Transactions on Communications•Jan 1, 2016•66 citations

Construction of Girth-Eight QC-LDPC Codes from Greatest Common Divisor

Guohua Zhang, Rong Xia Sun, Xinmei Wang

For any column weight J and any row weight L, a novel framework is proposed such that a girth-eight (J,L) quasi-cyclic low-density parity-check (QC-LDPC) code with any block length above a lower bound can be constructed via a simple inequality in terms of greatest common divisor (GCD). The main advantage is that the construction of a class of (J,L) girth-eight QC-LDPC codes is transformed into a rather simple task, searching for J integers satisfying the so-called GCD constraint for L. Combining the new method with masking matrices, a class of type-1 QC-LDPC codes is presented with girth at least eight. Simulation results show that the type-1 codes perform better than the random QC-LDPC codes and quadratic-congruence-based QC-LDPC codes for moderate block lengths and low code rates.

IEEE Communications Letters•Jan 2, 2013•47 citations

Explicit Constructions of Girth-Eight QC-LDPC Codes: A Unified Framework Motivated by TDGS

Guohua Zhang, Yulin Hu, Defeng Ren +1 more

A new search method named two-dimensional greedy search (TDGS) is proposed to progressively determine each element within an exponent matrix, so as to generate quasi-cyclic (QC) low-density parity-check (LDPC) codes without 4-cycles and 6-cycles. By applying four different two-dimensional scanning orders to the TDGS, a design framework is formulated to unify several existing and novel explicit constructions for short (3,$L$)-regular QC-LDPC codes without 4-cycles and 6-cycles. Through equivalence analysis between the exponent matrices greedily found by the TDGS and directly defined by explicit constructions, novel girth properties of (and connections between) these existing explicit constructions are also revealed.

IEEE Information Theory Workshop (ITW)•Nov 24, 2024•0 citations

The Design of Structured Low-Density Parity-Check Codes With Large Girth

Jing Long

This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.

Chinese Journal of Computers•Jan 1, 2007•1 citation

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

河本大輝, Kenta Kasai

This study proposes an explicit construction method for quantum quasi-cyclic low-density parity-check (QC-LDPC) codes with a girth of 12. The proposed method designs parity-check matrices that maximize the girth while maintaining an orthogonal structure suitable for quantum error correction. By utilizing algebraic techniques, short cycles are eliminated, which improves error correction performance. Additionally, this method is extended to non-binary LDPC codes and spatially-coupled LDPC codes, demonstrating that both the girth and orthogonality can be preserved. The results of this study enable the design of high-performance quantum error-correcting codes without the need for random search.

arXiv:2501.13444•Jan 23, 2025•8 citations

Random Constructions of Girth-Eight QC-LDPC Codes with Structural Shaping

Songyan Xue, Guohua Zhang

In order to construct girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes with low encoding complexity, this paper introduces structural shaping techniques to generate QC-LDPC codes with two different structures. These two structures are QC-LDPC codes constructed with vertical symmetric structure and reverse structure without 4-cycles and 6-cycles. Novel constructions assume that the structures of the parity check matrix (PCM) are symmetric and reverse, respectively, and the greedy exhaustive search algorithm is used to find the exponent matrix with the smallest possible size P of the circulant permutation matrix (CPM). Due to its symmetrical and reverse structural characteristics, the representation of the new codes is more compact than other codes. The simulation results show that the proposed codes have certain competitiveness compared to existing QC-LDPC codes.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 10, 2025•0 citations
To address the challenge of constructing short girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes, a novel construction framework based on vertical symmetry (VS) is proposed. Basic properties of the VS structure are presented. With the aid of these properties, existing explicit constructions for column weights from three to five which can be transformed into the VS structure are sorted out. Then two novel explicit constructions with the VS structure which guarantee short codes are presented for column weights of three and six. Moreover, an efficient search-based method is also proposed to find short codes with the VS structure. Compared with the state-of-the-art benchmarks, both the explicit constructions and the search-based method presented in this paper can provide shorter codes for most cases. Simulation results show that the new shorter codes can perform almost the same as or better than the longer existing counterparts. Thus, the new shorter codes can fit better with the low-latency requirement for modern communication systems.
In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions assume symmetries in the structure of the parity-check matrix and employ a greedy exhaustive search algorithm to find the permutation shifts of the CPMs. As a result of symmetries, the new codes have a more compact representation compared with their counterparts. In majority of cases, also, they achieve the girth 8 at a shorter block length for the same degree distribution (code rate). Deterministic (explicit) constructions are also presented to expand the proposed parity-check matrices to larger block lengths and higher rates. The proposed long high-rate codes are often substantially shorter than regular girth-8 QC-LDPC codes of similar rate in the literature. Simulation results demonstrate that the proposed symmetric codes have competitive performance in comparison with similar existing QC-LDPC codes that lack symmetry.
For any column weight J and any row weight L, a novel framework is proposed such that a girth-eight (J,L) quasi-cyclic low-density parity-check (QC-LDPC) code with any block length above a lower bound can be constructed via a simple inequality in terms of greatest common divisor (GCD). The main advantage is that the construction of a class of (J,L) girth-eight QC-LDPC codes is transformed into a rather simple task, searching for J integers satisfying the so-called GCD constraint for L. Combining the new method with masking matrices, a class of type-1 QC-LDPC codes is presented with girth at least eight. Simulation results show that the type-1 codes perform better than the random QC-LDPC codes and quadratic-congruence-based QC-LDPC codes for moderate block lengths and low code rates.
A new search method named two-dimensional greedy search (TDGS) is proposed to progressively determine each element within an exponent matrix, so as to generate quasi-cyclic (QC) low-density parity-check (LDPC) codes without 4-cycles and 6-cycles. By applying four different two-dimensional scanning orders to the TDGS, a design framework is formulated to unify several existing and novel explicit constructions for short (3,LLL)-regular QC-LDPC codes without 4-cycles and 6-cycles. Through equivalence analysis between the exponent matrices greedily found by the TDGS and directly defined by explicit constructions, novel girth properties of (and connections between) these existing explicit constructions are also revealed.
This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.
This study proposes an explicit construction method for quantum quasi-cyclic low-density parity-check (QC-LDPC) codes with a girth of 12. The proposed method designs parity-check matrices that maximize the girth while maintaining an orthogonal structure suitable for quantum error correction. By utilizing algebraic techniques, short cycles are eliminated, which improves error correction performance. Additionally, this method is extended to non-binary LDPC codes and spatially-coupled LDPC codes, demonstrating that both the girth and orthogonality can be preserved. The results of this study enable the design of high-performance quantum error-correcting codes without the need for random search.
In order to construct girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes with low encoding complexity, this paper introduces structural shaping techniques to generate QC-LDPC codes with two different structures. These two structures are QC-LDPC codes constructed with vertical symmetric structure and reverse structure without 4-cycles and 6-cycles. Novel constructions assume that the structures of the parity check matrix (PCM) are symmetric and reverse, respectively, and the greedy exhaustive search algorithm is used to find the exponent matrix with the smallest possible size P of the circulant permutation matrix (CPM). Due to its symmetrical and reverse structural characteristics, the representation of the new codes is more compact than other codes. The simulation results show that the proposed codes have certain competitiveness compared to existing QC-LDPC codes.