5 problems

Let $\delta^*(n,\epsilon)$ denote the highest achievable normalized log-density at block length $n$ and error probability $\epsilon$, and let $\delta^*$ and $V$ denote the Poltyrev…

Let $\mathscr{C}_{\text{reg}}(\mathcal{W})$ denote the set of memoryless and nonstationary block erasure channels, and let … is asymptotically tight to first- and second-order over…

In a finite-blocklength secure communication system, let the degrees-of-freedom margin be small compared to the number of legitimate users. The sum-rate tradeoff conjecture. Focusi…

Measurement-dependent channel conjecture. The additional exponential terms in the upper bound are fundamentally related to the measurement-dependent channel assumption underlying t…

Let $n$ be the block length, let $\epsilon$ be fixed, and let the highest achievable normalized log-density (NLD) be evaluated for an infinite constellation over a fading channel.…