← 研踪 PaperTrailarXiv:2611.14087 · v1
Classical Tensor Codes and Quantum Tanner Codes Achieve Capacity on Erasure Channels
首次提交 2026-11-10 21:50
版本更新 2026-11-10 21:50
雷达观测 2026-11-11 13:08
摘要
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 and every rate gap , we obtain a family of binary quantum Tanner codes of rate at least . 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.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-10 21:50 · 最新观测版本
Classical Tensor Codes and Quantum Tanner Codes Achieve Capacity on Erasure Channels
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 and every rate gap , we obtain a family of binary quantum Tanner codes of rate at least . 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.
查看此版本解读 →查看此版本原文 ↗