A strong converse for a collection of network source coding problems
- Creators
- Gu, WeiHsin
- Effros, Michelle
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.
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.Attached Files
Published - Gu2009p110772009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf
Files
Name | Size | Download all |
---|---|---|
md5:ed5dd74f6113b0e38f50e30421a8fb93
|
439.1 kB | Preview Download |
Additional details
- Eprint ID
- 19440
- Resolver ID
- CaltechAUTHORS:20100816-111642548
- CCF-0325324
- NSF
- Caltech Lee Center for Advanced Networking
- Created
-
2010-08-16Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 10842452