3 problems

Low-dimensional sum-set decomposition conjecture. For every choice of $\ell\in\mathbb N$, $\varepsilon>0$, and $R>0$, the decomposition above exists for all sufficiently large fold…

Chen–Zhang's conjecture. For the stated parameters, folded Reed–Solomon codes achieve list-recovery radius arbitrarily close to $rho^*$ with input list size $ell$ and output list s…

Let $\rho$ denote the upper-bound radius for $(\rho,\ell,L)$ list-recoverability established for folded Reed–Solomon codes, and suppose that $L+1=\ell^a$ for an integer $a\geq 2$.…