Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations.
Fifteen years of quantum LDPC coding and improved decoding strategies,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2representative 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.
citing papers explorer
-
Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations.
-
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.