2 problems

List-decoding Plotkin-point conjecture. In this case, the largest code size is

Let $R(\tau)$ denote the maximum asymptotic rate for error-correcting codes over the Z-channel with noiseless feedback in the combinatorial setting, where $\tau$ is the fraction of…