Date Added: Apr 2013
The authors present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limited side-information, the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and 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. Their bounds for all three problems improve on all previous non-asymptotic bounds on the error probability of the WAK, WZ and GP problems-in particular those derived by Verdu.