Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ULRICH HABÖCK:
All reports by Author Ulrich Haböck:

TR25-169 | 7th November 2025
Eli Ben-Sasson, Dan Carmon, Ulrich Haböck, Swastik Kopparty, Shubhangi Saraf

On Proximity Gaps for Reed-Solomon Codes

This paper is about the proximity gaps phenomenon for Reed-Solomon codes.
Very roughly, the proximity gaps phenomenon for a code $\mathcal C \subseteq \mathbb F_q^n$ says that for two vectors $f,g \in \mathbb F_q^n$, if sufficiently many linear combinations $f + z \cdot g$ (with $z \in \mathbb F_q$) ... more >>>




ISSN 1433-8092 | Imprint