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 Information Processing

A class of quantum low-density parity check codes by combining seed graphs

Yongsoo Hwang, Youngjoo Chung, Moongu Jeon

Published Jan 3, 2013• 1 citation
Publisher
DOI
10.1007/s11128-012-0519-z

Related papers

Minimum span analysis for a combined graph ensemble of low-density parity-check codes

Yujin Ishikawa, Yoshiyuki Satô, Gou Hosoya +1 more

IEICE Technical Report; IEICE Tech. Rep.•Mar 2, 2009•0 citations

Quantum low-density parity-check codes

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2022•4 citations

Decoding Quantum LDPC Codes Using Graph Neural Networks

Vukan Ninković, Ognjen Kundačina, Dejan Vukobratović +2 more

In this paper, we propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs). Similar to the Belief Propagation (BP)-based QLDPC decoders, the proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm. We compare the proposed GNN-based decoding algorithm against selected classes of both conventional and neural–enhanced QLDPC decoding algorithms across several QLDPC code designs. The simulation results demonstrate excellent performance of GNN-based decoders along with their low complexity compared to competing methods.

arXiv:2408.05170•Globecom•Dec 8, 2024•10 citations

Construction of Low-Density Parity-Check Codes by Superposition

J. Xu, Lei Chen, Lingqi Zeng +2 more

This paper presents a superposition method for constructing low-density parity-check (LDPC) codes. Several classes of structured LDPC codes are constructed. Codes in these classes perform well with iterative decoding, and their Tanner graphs have girth at least six.

IEEE Transactions on Communications•Feb 1, 2005•88 citations

A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes with Two Information Symbols

Ivana Djurdjevic, Jun Xu, Khaled Abdel-Ghaffar +1 more

Lecture notes in computer science•Jan 1, 2003•24 citations

Decoding of generalised low-density parity-check codes using weighted bit-flip voting

S. Hirst, B. Honary

A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. Performance is found to compete well with other more conventional hard decision decoding schemes.

IEE Proceedings - Communications•Jan 1, 2002•19 citations
In this paper, we propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs). Similar to the Belief Propagation (BP)-based QLDPC decoders, the proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm. We compare the proposed GNN-based decoding algorithm against selected classes of both conventional and neural–enhanced QLDPC decoding algorithms across several QLDPC code designs. The simulation results demonstrate excellent performance of GNN-based decoders along with their low complexity compared to competing methods.
A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. Performance is found to compete well with other more conventional hard decision decoding schemes.