arXiv (All)
open access
High-Girth QLDPC Codes from Circulant and Affine Permutation Matrices
We study two explicit constructions of binary Calderbank--Shor--Steane quantum low-density parity-check (QLDPC) codes with check weight six. The first uses a fixed circulant shift pattern and yields parameters $\code{6N}{2N+2}{6}$ with Tanner graph girth twelve for $N=31$ and every $N\ge37$. A graph
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
- Low-Density Parity-Check Codes of High Girth from Permutation Polynomials#1188019
- High-Rate Quasi-Dyadic Quantum LDPC Codes#1050384
- Lifted-Product QLDPC Codes in the Polynomial Domain#821254
- LDPC Fractus Codes: Sparse Codes with Recursive Structure#1131091
- Bicycle Race: small two-block codes on the Pareto frontier#1298376
Record · ID 1345274
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