A Caltech Library Service

A strong converse for a collection of network source coding problems

Gu, WeiHsin and Effros, Michelle (2009) A strong converse for a collection of network source coding problems. In: ISIT 2009. IEEE , Piscataway, NJ, pp. 2316-2320. ISBN 978-1-4244-4312-3 .

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
Additional Information:© 2009 IEEE. This material is based upon work partially supported by NSF Grant No. CCF-0325324 and Caltech’s Lee Center for Advanced Networking.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number10842452
Record Number:CaltechAUTHORS:20100816-111642548
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:19440
Deposited By: Tony Diaz
Deposited On:16 Aug 2010 18:44
Last Modified:26 Dec 2012 12:19

Repository Staff Only: item control page