Sahami, Arvin

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs

2025 · arXiv (Cornell University)

For a linear code $\mathcal{C} \subseteq \mathbb{F}_2^n$ and $α\in [0,1]$, call a set $S \subseteq [n]$ an (unweighted) one-sided $α$-sparsifier of $\mathcal{C}$ if for all $c \in \mathcal{C}$, $\mathrm{wt}(c_S)\geq α\cdot \mathrm{wt}(c)$, where $c_S$ is the …