5 problems

Optimality conjecture. The quantity $\xi^*(R,T)$ reflects the best fraction of $E_1(R,T,\theta)$, and correspondingly of $E_2(R,T,\theta)$ in the stated sense, that any decoder una…

Let a discrete memoryless channel (DMC) be given, and consider a communication system using a generalized random Gilbert–Varshamov (RGV) code ensemble. Universality means that both…

Let a generalized random Gilbert–Varshamov (RGV) code ensemble be used for communication over a discrete memoryless channel, and let the typical random-coding (TRC) error exponent…

Let $W(z|x)$ be the single-letter transition probabilities of a memoryless channel, and consider the proposed universal decoder for channels whose transmitted codewords undergo los…

Let $\xi$ be the fraction of the optimal undetected-error and erasure exponents for the known-channel case that is guaranteed by the competitive minimax universal decoding procedur…