Abstract-We present a novel nonasymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include: 1) the Wyner-Ahlswede-Körner (WAK) problem of almost-lossless source coding with rate-limited side-information; 2) the Wyner-Ziv (WZ) problem of lossy source coding with sideinformation at the decoder; and 3) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous nonasymptotic bounds on the error probability of the WAK, WZ, and GP problems-in particular those derived by Verdú. Using our novel nonasymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esséen theorem to our new nonasymptotic bounds. Numerical results show that the second-order coding rates obtained using our nonasymptotic achievability bounds are superior to those obtained using existing finite blocklength bounds.
Achievable second-order coding rates for the Wyner-Ahlswede-Korner problem of almost-lossless source coding with rate-limited side-information, the Wyner-Ziv problem of lossy source coding with side-information at the decoder and the Gelfand-Pinsker problem of channel coding with non-causal state information available at the decoder were established in REF .
Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Mathematics Computer Science