arXiv (All)
open access
Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search
Bicycle (two-block circulant) quantum low-density parity-check (LDPC) codes include some of the best known small quantum codes, yet their design has relied on group-algebra formulations in which the dimension and distance are accessible only through matrix computation. We show that in the cyclic cas
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Cyclicity of Binary Group Codes.#1173
- The kernel-block rank profile and a complete classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes#996775
- Computing with qLDPC Codes by Climbing the Chain Map Hierarchy#925372
- Computing with qLDPC Codes by Climbing the Chain Map Hierarchy#921136
- Symmetric matrices and quantum codes#639207
Record · ID 820598
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive