Bivariate bicycle codes have predictable dimensions and existence conditions from ring structure but are asymptotically bad, excluding them from good LDPC searches while preserving utility for moderate lengths.
In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , STOC 2022, page 375–388, New York, NY, USA
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Existence and Characterisation of Bivariate Bicycle Codes
Bivariate bicycle codes have predictable dimensions and existence conditions from ring structure but are asymptotically bad, excluding them from good LDPC searches while preserving utility for moderate lengths.