2013/01/28 by Shun Watanabe, Watanabe, Shun, Shigeaki Kuzuoka +3 · 3 citations
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1301.6467
openalex publication_date 2013/01/28 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
We present novel non-asymptotic or finite blocklength achievability bounds\nfor three side-information problems in network information theory. These\ninclude (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source\ncoding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of\nlossy source coding with side-information at the decoder and (iii) the\nGel'fand-Pinsker (GP) problem of channel coding with noncausal state\ninformation available at the encoder. The bounds are proved using ideas from\nchannel simulation and channel resolvability. Our bounds for all three problems\nimprove on all previous non-asymptotic bounds on the error probability of the\nWAK, WZ and GP problems--in particular those derived by Verdu. Using our novel\nnon-asymptotic bounds, we recover the general formulas for the optimal rates of\nthese side-information problems. Finally, we also present achievable\nsecond-order coding rates by applying the multidimensional Berry-Esseen theorem\nto our new non-asymptotic bounds. Numerical results show that the second-order\ncoding rates obtained using our non-asymptotic achievability bounds are\nsuperior to those obtained using existing finite blocklength bounds.\n