SAGMS decoder adapts Min-Sum scaling factor during decoding based on unsatisfied stabilizer fraction to match optimized scaled Min-Sum and approach BP performance for QLDPC codes at MS complexity.
Enhanced Min- Sum Decoding of Quantum Codes Us- ing Previous Iteration Dynamics
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
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.
Edge-coloring eliminates automorphisms in low-weight stabilizer subgraphs of generalized bicycle codes, enabling improved anisotropic min-sum decoding.
Quantum Margulis codes are constructed from classical Margulis LDPC codes via two-block group algebra, enabling linear-complexity min-sum decoding and better error-floor performance than bivariate bicycle codes under code-capacity noise.
citing papers explorer
-
Syndrome Adaptive Gain Control for Min-Sum Decoding of Quantum LDPC Codes
SAGMS decoder adapts Min-Sum scaling factor during decoding based on unsatisfied stabilizer fraction to match optimized scaled Min-Sum and approach BP performance for QLDPC codes at MS complexity.
-
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.
-
Edge-Based Anisotropic Decoding for Generalized Bicycle Codes
Edge-coloring eliminates automorphisms in low-weight stabilizer subgraphs of generalized bicycle codes, enabling improved anisotropic min-sum decoding.
-
Construction and Decoding of Quantum Margulis Codes
Quantum Margulis codes are constructed from classical Margulis LDPC codes via two-block group algebra, enabling linear-complexity min-sum decoding and better error-floor performance than bivariate bicycle codes under code-capacity noise.