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:quant-ph/0701020 · IEEE International Symposium on Information Theory (ISIT)

Quantum Quasi-Cyclic LDPC Codes

Manabu Hagiwara, Hideki Imai

Published Jun 1, 2007• 77 citations
arXivHTMLPDF

Abstract

In this paper, a construction of a pair of quasi-cyclic LDPC codes to construct a quantum error-correcting code is proposed. Our construction method is based on algebraic combinatorics and have lots of variations for length, code rate.
DOI
10.1109/isit.2007.4557323

Related papers

Quantum Quasi-Cyclic LDPC Codes

Manabu Hagiwara, Hideki Imai

Abstract — In this paper, a construction of a pair of quasicyclic LDPC codes to construct a quantum error-correcting code is proposed. Our construction method is based on algebraic combinatorics and have lots of variations for length, code rate. I.

•Jan 1, 2007•66 citations

Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes$\,$"

Dazu Huang, Zhigang Chen, Li, Xin +1 more

In our recent paper entitled "Quantum Quasi-Cyclic Low-Density Parity-Check codes" [ICIC 2009. LNCS 5754], it was claimed that some new quantum codes can be constructed via the CSS encoding/decoding approach with various lengths and rates. However, the further investigation shows that the proposed construction may steal some ideas from the paper entitled "Quantum Quasi-Cyclic LDPC codes" [quant-ph/0701020v2]. We feel that the apologizing point of the original protocol is that some results are almost similar to that of construction methods with algebraic combinatorics although we suggest the different approach for improving them. Also, there is a weak point of the original coding approach while considering the application of codes in imperfect channels.

arXiv:1004.4488•Apr 26, 2010•0 citations

Non-binary quasi-cyclic quantum LDPC codes

Kenta Kasai, Manabu Hagiwara, Hideki Imai +1 more

In this paper, we propose a construction method for two-level quantum error-correcting codes via non-binary LDPC codes over an extended field of order 2p, p an integer p >; 1. The proposed quantum error-correcting codes are based on binary quasi-cyclic LDPC codes which have almost achieved a “Bounded Distance Decoding (BDD)” limit but have not surpassed the limit yet. Quantum codes constructed from the proposed method surpass the BDD limit. Furthermore the codes outperform the efficiently-decodable state-of-the-art quantum codes.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•12 citations

Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes

Shu Hwa Lin, Shumei Song, Ying Tai +2 more

In the late 1950's and early 1960's, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for correcting random errors with algebraic decoding, such as Bose-Chaudhuri-Hocqenghem (BCH) and Reed-Solomon (RS) codes. Recently it has been shown that finite fields can also be used successfully to construct binary quasi-cyclic (QC)-LDPC codes that perform very well not only over the AWGN channel but also over the binary erasure channel with iterative decoding, besides being efficiently encodable. This paper is concerned with constructions of nonbinary QC-LDPC codes based on finite fields

International Conference on Communications, Circuits and Systems•Jun 1, 2006•19 citations

QUANTUM ERROR-CORRECTING CODES FROM QUASI-CYCLIC CODES

Jianfa Qian, Wenping Ma, Xinmei Wang

Quasi-cyclic codes form a generalization of cyclic codes, and contain a large number of record breaking codes. In this paper, we provide a method for constructing self-orthogonal quasi-cyclic codes, and obtain a large number of new quantum quasi-cyclic codes by CSS construction.

International Journal of Quantum Information•Dec 1, 2008•7 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
Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes \,"
In our recent paper entitled "Quantum Quasi-Cyclic Low-Density Parity-Check codes" [ICIC 2009. LNCS 5754], it was claimed that some new quantum codes can be constructed via the CSS encoding/decoding approach with various lengths and rates. However, the further investigation shows that the proposed construction may steal some ideas from the paper entitled "Quantum Quasi-Cyclic LDPC codes" [quant-ph/0701020v2]. We feel that the apologizing point of the original protocol is that some results are almost similar to that of construction methods with algebraic combinatorics although we suggest the different approach for improving them. Also, there is a weak point of the original coding approach while considering the application of codes in imperfect channels.
In this paper, we propose a construction method for two-level quantum error-correcting codes via non-binary LDPC codes over an extended field of order 2p, p an integer p >; 1. The proposed quantum error-correcting codes are based on binary quasi-cyclic LDPC codes which have almost achieved a “Bounded Distance Decoding (BDD)” limit but have not surpassed the limit yet. Quantum codes constructed from the proposed method surpass the BDD limit. Furthermore the codes outperform the efficiently-decodable state-of-the-art quantum codes.
In the late 1950's and early 1960's, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for correcting random errors with algebraic decoding, such as Bose-Chaudhuri-Hocqenghem (BCH) and Reed-Solomon (RS) codes. Recently it has been shown that finite fields can also be used successfully to construct binary quasi-cyclic (QC)-LDPC codes that perform very well not only over the AWGN channel but also over the binary erasure channel with iterative decoding, besides being efficiently encodable. This paper is concerned with constructions of nonbinary QC-LDPC codes based on finite fields
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.