4 problems

Refined scaling conjecture. As $n$ tends to infinity,

Let $(n)$ be a sequence of polar codes with increasing blocklength $n$, fixed error-probability upper bound $P_e$, rate $\frac{r}{n}$, and channel capacity $C$. The scaling exponen…

Let $\{\mu_m\}_{m\in\mathbb{N}}$ be the increasing sequence of candidate universal scaling parameters obtained by verifying concavity of the auxiliary polynomial associated with in…

Let $W$ be a binary-input memoryless output-symmetric channel with capacity $I(W)$. For rates $R<I(W)$ and a fixed positive error threshold $P_{\rm e}$, suppose the blocklength req…