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

Quantum quasi-cyclic low-density parity-check codes

Dazu Huang, Zhigang Chen, Xin Li, Ying Guo

Published Sep 16, 2009• 5 citations
OpenAlex

Related papers

Quantum Low-Density Parity-Check Codes

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2012•4 citations

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

河本大輝, Daiki Komoto, Kenta Kasai

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

•Jul 20, 2026•0 citations

Near Shannon limit quasi-cyclic low-density parity-check codes

Shu Lin, Lei Chen, Jun Xu +1 more

The paper presents two classes of quasi-cyclic low-density parity-check (LDPC) codes which perform close to the Shannon limit. The construction of these codes is based on decomposition of circulant matrices constructed from finite geometries.

Globecom•Mar 22, 2004•40 citations

Quantum low-density parity-check codes

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2022•4 citations

Quasi-Cyclic Generalized LDPC Codes With Low Error Floors

Gianluigi Liva, W.E. Ryan, Marco Chiani

In this paper, a novel methodology for designing structured generalized low-density parity-check (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits. The structure imposed on the bipartite graphs, together with the choice of simple component codes, leads to a class of codes suitable for fast iterative decoding. A pragmatic approach to the construction of G-LDPC codes is proposed. The approach is based on the substitution of check nodes in the protograph of a low-density parity-check code with stronger nodes based, for instance, on Hamming codes. Such a design approach, which we call low-density parity-check (LDPC) code doping, leads to low-rate quasi-cyclic G-LDPC codes with excellent performance in both the error floor and waterfall regions on the additive white Gaussian noise channel.

IEEE Transactions on Communications•Dec 1, 2007•9 citations

Good quantum low-density parity-check codes

Fanny Terrier

•Sep 11, 2023•0 citations
In this paper, a novel methodology for designing structured generalized low-density parity-check (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits. The structure imposed on the bipartite graphs, together with the choice of simple component codes, leads to a class of codes suitable for fast iterative decoding. A pragmatic approach to the construction of G-LDPC codes is proposed. The approach is based on the substitution of check nodes in the protograph of a low-density parity-check code with stronger nodes based, for instance, on Hamming codes. Such a design approach, which we call low-density parity-check (LDPC) code doping, leads to low-rate quasi-cyclic G-LDPC codes with excellent performance in both the error floor and waterfall regions on the additive white Gaussian noise channel.