Answers are grounded in this paper and cite their sources.
We show that on the classical erasure channel, the tensor product of two capacity-achieving code families is itself capacity-achieving under mild conditions. We also prove that duals of tensor products of independent uniform random binary linear codes achieve erasure capacity. Using these local codes, for every erasure probability ρ∈(0,1/2) and every rate gap ε>0, we obtain a family of binary quantum Tanner codes of rate at least 1-2ρ-ε. For fixed $ρ$ and ε, these codes have bounded check weights, minimum distance growing linearly with the blocklength, and a linear-time erasure decoder whose decoding error decays exponentially with the blocklength.
No takes yet. Share an insight, caveat, or question.
Pfister et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: