MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.
Trapping sets of quantum LDPC codes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes
MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.