Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > LIST-RECOVERABLE CODES:
Reports tagged with list-recoverable codes:
TR26-317 | 11th November 2026
Joshua Brakensiek, Yeyuan Chen, Mahdi Cheraghchi, Rohan Goyal, Venkatesan Guruswami, Aaron (Louie) Putterman, Zihan Zhang

Explicit Subspace Evasive Sets via Subspace Designs

Given a finite field $\mathbb F_q$, we say that a set $A\subseteq \mathbb F^n_q$ is an $(r,c)$ subspace evasive set if and only if for any affine subspace $U\subseteq \mathbb F^n_q$ with bounded dimension $\dim(U)\leq r$, the intersection size $|A\cap U|$ is at most $c$. The probabilistic method shows the ... more >>>




ISSN 1433-8092 | Imprint