arXiv (All)
open access
Lifted-Product QLDPC Codes in the Polynomial Domain
This paper presents a finite-length polynomial-domain formulation of lifted-product quantum low-density parity-check (QLDPC) codes. We formulate the code construction over the quotient ring F 2[D]/(D L + 1), where polynomial base matrices are lifted entrywise to binary circulant blocks. This represe
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
- High-Rate Quasi-Dyadic Quantum LDPC Codes#1050384
- Toward Universal Belief Propagation Decoding for Short Binary Block Codes#135308
- On Twisted Roth-Lempel Codes#1123676
- Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes#147147
- LDPC Fractus Codes: Sparse Codes with Recursive Structure#1131091
Record · ID 821254
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