4 problems

Finite-blocklength leakage fit conjecture. For some constants $\xi_1,\xi_2\geq 1$ depending only on the coding scheme, the leaked information can be approximated well by

Consider certain families of iteratively decoded code ensembles and general channel models. Let $\bar{\mathbb{P}}^{(n)}_{e,\operatorname{it}}(p)$ denote the optimal error probabili…

Let $\{R_n\}_{n=1}^\infty$ be a real sequence, and let $\ell_n$ be the remainder sequence in the finite-dimensional approximation of Feinstein's upper bound, with…

For a discrete memoryless channel with a finite message set of size $M$, consider rateless coding with a decoder whose decoding length is a stopping time and whose error probabilit…