arXiv (All)
open access
Improved Decoding of Quantum Tanner Codes Using Generalized Check Nodes
We study the decoding problem for quantum Tanner codes and propose to exploit the underlying local code structure by grouping check nodes into more powerful generalized check nodes for enhanced iterative belief propagation (BP) decoding by decoding the generalized checks using a maximum a posteriori
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
- Full classification of $\mathbb{Z}_{p^s}$-linear generalized Hadamard codes#1343920
- Constant-time decoding of Gabidulin codes and their generalizations with application to RQC#394329
- Coding Agents for Coding Theory#1144048
- From Symmetry to Capacity: Nested Codes on Binary Memoryless Symmetric Channels#925042
- From Symmetry to Capacity: Nested Codes on Binary Memoryless Symmetric Channels#920808
Record · ID 1215378
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