

























In this report we flesh out a sketch by Krachun and Kazanin to prove that for a certain family of Reed-Solomon codes, proximity gaps fail at radii that are $O(1/\log n)$ below the capacity rate of the code, where $n$ is the length of the code.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。