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:2501.13444

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

河本大輝, Kenta Kasai

Published Jan 23, 2025• 8 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2501.13444

Related papers

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

Heade kvantveaparanduskoodide otsing

Aitsen, Daglas

Quantum error correction codes are developed to correct errors that occur in quantum data. However, their design is complicated by the fundamental constraints of quantum mechanics. This thesis explores how to adapt quasi-cyclic low-density parity-check (QC-LDPC) codes, used in classical communications, for quantum error correction. Since a small girth in an LDPC code is linked to poor decoding performance, this thesis focuses on constructing quantum QC-LDPC codes with large girth. To achieve this, we present two methods: one based on minimal-weight codewords and another based on multiplicity constraints to avoid short cycles. Using these approaches, we construct quantum QC-LDPC codes with girth 8. The construction methods offer a more flexible alternative to existing techniques, enabling the design of large-girth codes with a wider range of structures and sizes.

•Jan 1, 2025•0 citations

Non-Binary QC-LDPC Codes with Large Girth Devoid of Dominant Absorbing Sets

Suresh Kumar Venkataramanappa, Pavan Kumar, Deepak Mishra +1 more

Non-binary (NB) low-density parity-check (LDPC) codes offer superior error-correcting performance compared to binary LDPC codes, especially for short and medium lengths. Constructing such codes with large girth remains challenging due to various combinatorial constraints. We present a novel algebraic and graph-theoretic construction of non-binary quasi-cyclic (QC) LDPC codes with column weight two and girth 12, which is known to be largest achievable girth for array-based QC-LDPC codes. In constructing girth-12 (2, dc) NB-QC-LDPC codes, our method attains the minimum possible code length for dc < 10. Motivated by the fact that non-binary spatially coupled (SC) QC-LDPC codes achieve optimal performance at column weight three, we further construct NB-SC-QC-LDPC codes with girth ≥ 8 while effectively reducing the number of 8-cycles. Specifically, for (3, dc) codes, our design eliminates dominant absorbing sets such as the (3, 3) and (4, 2), eliminates the (5, 1) elementary absorbing sets (EAS), and eliminates almost all (6, 2) EAS, thereby directly enhancing the error-correction performance. The proposed NB-QC-LDPC codes achieve performance comparable to NB-LDPC codes used in the BeiDou satellite navigation system, while requiring a significantly smaller parity-check matrix storage footprint, for instance, around a 44× reduction in storage requirements with respect to BeiDou rate-1/2 (88, 44) code. Also, the proposed rate-1/2 code with length n = 684 provide a 0.4 dB gain over non-binary near-regular QC-LDPC code with same parameters proposed by Huang et al. [IEEE Trans. Commun.] while requiring a smaller parity-check matrix storage footprint. Furthermore, the proposed rate-1/2 NB-SC-QC-LDPC code having length n = 4608 achieve 0.1 dB coding gain compared to existing protograph constructions while requiring a significantly smaller parity-check matrix storage footprint, i.e., around a 192× reduction.

•Oct 15, 2025•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

Quasi-Cyclic Spatially Coupled LDPC Codes Construction with Girth Eight

Shikui Guo, Guohua Zhang

Small cycles in spatially coupled low-density paritycheck (SC-LDPC) codes have a detrimental effect on the error floor. Recently, an explicit simple method has been proposed to construct a class of 4-cycle free SC-LDPC codes by partitioning a spreading matrix into a number of component matrices. Using a quasi-cyclic (QC) lifting, we propose a component matrices construction method to obtain QC-SC-LDPC codes with a girth eight in this paper. The component matrices of the new method are completely defined by a spreading matrix and an exponent matrix. The spreading matrix is constructed from a finite sequence of integers, and the exponent matrix is constructed from the greatest common divisor (GCD) framework. The novel construction method demonstrates the capacity to entirely eliminate 6-cycles. Compared to the recently proposed explicit structural design, the proposed code achieves a girth of eight and exhibits better bit-error rate (BER) performance.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 10, 2025•0 citations

Quasi-Cyclic Low-Density Parity-Check Codes Based on Progressive Cycle Growth Algorithm

Yuanhua Liu, Meiling Zhang, Niu Xin-Liang

Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Jul 1, 2016•1 citation
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.
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.
Quantum error correction codes are developed to correct errors that occur in quantum data. However, their design is complicated by the fundamental constraints of quantum mechanics. This thesis explores how to adapt quasi-cyclic low-density parity-check (QC-LDPC) codes, used in classical communications, for quantum error correction. Since a small girth in an LDPC code is linked to poor decoding performance, this thesis focuses on constructing quantum QC-LDPC codes with large girth. To achieve this, we present two methods: one based on minimal-weight codewords and another based on multiplicity constraints to avoid short cycles. Using these approaches, we construct quantum QC-LDPC codes with girth 8. The construction methods offer a more flexible alternative to existing techniques, enabling the design of large-girth codes with a wider range of structures and sizes.
Non-binary (NB) low-density parity-check (LDPC) codes offer superior error-correcting performance compared to binary LDPC codes, especially for short and medium lengths. Constructing such codes with large girth remains challenging due to various combinatorial constraints. We present a novel algebraic and graph-theoretic construction of non-binary quasi-cyclic (QC) LDPC codes with column weight two and girth 12, which is known to be largest achievable girth for array-based QC-LDPC codes. In constructing girth-12 (2, dc) NB-QC-LDPC codes, our method attains the minimum possible code length for dc < 10. Motivated by the fact that non-binary spatially coupled (SC) QC-LDPC codes achieve optimal performance at column weight three, we further construct NB-SC-QC-LDPC codes with girth ≥ 8 while effectively reducing the number of 8-cycles. Specifically, for (3, dc) codes, our design eliminates dominant absorbing sets such as the (3, 3) and (4, 2), eliminates the (5, 1) elementary absorbing sets (EAS), and eliminates almost all (6, 2) EAS, thereby directly enhancing the error-correction performance. The proposed NB-QC-LDPC codes achieve performance comparable to NB-LDPC codes used in the BeiDou satellite navigation system, while requiring a significantly smaller parity-check matrix storage footprint, for instance, around a 44× reduction in storage requirements with respect to BeiDou rate-1/2 (88, 44) code. Also, the proposed rate-1/2 code with length n = 684 provide a 0.4 dB gain over non-binary near-regular QC-LDPC code with same parameters proposed by Huang et al. [IEEE Trans. Commun.] while requiring a smaller parity-check matrix storage footprint. Furthermore, the proposed rate-1/2 NB-SC-QC-LDPC code having length n = 4608 achieve 0.1 dB coding gain compared to existing protograph constructions while requiring a significantly smaller parity-check matrix storage footprint, i.e., around a 192× reduction.
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.
Small cycles in spatially coupled low-density paritycheck (SC-LDPC) codes have a detrimental effect on the error floor. Recently, an explicit simple method has been proposed to construct a class of 4-cycle free SC-LDPC codes by partitioning a spreading matrix into a number of component matrices. Using a quasi-cyclic (QC) lifting, we propose a component matrices construction method to obtain QC-SC-LDPC codes with a girth eight in this paper. The component matrices of the new method are completely defined by a spreading matrix and an exponent matrix. The spreading matrix is constructed from a finite sequence of integers, and the exponent matrix is constructed from the greatest common divisor (GCD) framework. The novel construction method demonstrates the capacity to entirely eliminate 6-cycles. Compared to the recently proposed explicit structural design, the proposed code achieves a girth of eight and exhibits better bit-error rate (BER) performance.
Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.