Title :
A strong converse for a collection of network source coding problems
Author :
Gu, WeiHsin ; Effros, Michelle
Author_Institution :
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
fDate :
June 28 2009-July 3 2009
Abstract :
We prove a strong converse for particular source coding problems: the Ahlswede-Korner (coded side information) problem, lossless source coding for multicast networks with side-information at the end nodes, and the Gray-Wyner problem. Source and side-information sequences are drawn i.i.d. according to a given distribution on a finite alphabet. The strong converse discussed here states that when a given rate vector R is not D-achievable, the probability of observing distortion D for any sequence of block codes at rate R must decrease exponentially to 0 as the block length grows without bound. This strong converse implies the prior strong converses for the point-to-point network, Slepian-Wolf problem, and Ahlswede-Korner (coded side information) problem.
Keywords :
block codes; multicast communication; source coding; Ahlswede-Korner problem; D-achievable; Gray-Wyner problem; Slepian-Wolf problem; block codes; coded side information problem; lossless source coding; multicast networks; network source coding problems; point-to-point network; side-information sequences; source sequences; Block codes; Convergence; Error probability; Rate-distortion; Source coding;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205934