arXiv (OAI Expanded)
open access
Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
We study hard-erasure belief-propagation (BP), understood as the sum-product algorithm on erasure messages, for a punctured MacKay-Neal/Hsu-Anastasopoulos (MN/HA) representation of Calderbank-Shor-Steane (CSS) codes. For every integer degree triple $2\leq j_Z<j_X<k\leq60$, we prove that the constitu
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
- Analytic Maximal Violation of Extended MABK Inequalities for Generalized GHZ States#822452
- Dual lattice attacks for bounded distance decoding, revisited#1141805
- A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs#1118337
- Introduction to coding theory and algebraic geometry. (Based on lectures given in the seminar held at Schloß Mickeln, Düsseldorf, November 16-21, 1987)#490301
- Quantum bivariate bicycle codes with weight-8 checks surpassing the BB benchmark#974684
Record · ID 1083125
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