arXiv (All)
open access
Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes
Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically rather than read from the defining polynomials. We study the $Z$-logical quotient $K/S$ over $\mathbb F_2[x,y]/(x^\ell-1,
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
- On the construction of universal families of hash functions via geometric codes and concatenation#612900
- Cyclicity of Binary Group Codes.#1173
- On the Hamming distance properties of group codes#490073
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189148
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189098
Record · ID 1144362
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