Classical Tensor Codes and Quantum Tanner Codes Achieve Capacity on Erasure Channels
cs.IT, math.IT
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- List Decodable Quantum LDPC Codes
- Quantum Maxwell Erasure Decoder for qLDPC codes
- Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time
- From Random Quantum Codes to Explicit qLDPC Codes via Local Properties
- Two-sided Robustly Testable Codes
- Good quantum LDPC codes with linear time decoder from lossless expanders
- Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound
- Stabilizer-Assisted Inactivation Decoding of Quantum Error-Correcting Codes with Erasures
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound