2 problems

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$.…

Let $\cP$ be a $b$-local, monotone-decreasing LCL property, and let $R_\cP$ denote its threshold rate. For every $\eps>0$ and $b\in\mathbb{N}$, there exist constants $n_0$ and…