4 problems

Csiszár–Narayan conjecture. The mismatch capacity under the maximum-metric decoder for discrete-memoryless channels and product decoding metrics is given by the limiting multi-lett…

Let $W$ be a discrete memoryless channel with decoding metric $q$, and let $C_{\mathrm{M}}$ denote the mismatched capacity. For each positive integer $k$, let…

Let $C_{q,\mathrm{threshold}}^{\mathrm{const}}(P,W)$ denote the threshold capacity for constant-composition codes with input distribution $P$, and let $\tau_n$ be a given threshold…

Let $W$ be a discrete memoryless channel and $V$ be a mismatched decoding metric. For blocklength $N$, consider the family of lower bounds on the mismatched capacity $C(W,V)$ obtai…