Published August 18, 2009
| Published
Book Section - Chapter
Open
On feedback in network source coding
- Creators
- Bakshi, Mayank
- Effros, Michelle
Abstract
We consider source coding over networks with unlimited feedback from the sinks to the sources. We first show examples of networks where the rate region with feedback is a strict superset of that without feedback. Next, we find an achievable region for multiterminal lossy source coding with feedback. Finally, we evaluate this region for the case when one of the sources is fully known at the decoder and use the result to show that this region is a strict superset of the best known achievable region for the problem without feedback.
Additional Information
© 2009 IEEE. This work is partially supported by NSF Grant CCF-0325324, DARPA Grant W911NF-07-I0029, and the Lee Center for Advanced Networking at Caltech.Attached Files
Published - Bakshi2009p110752009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf
Files
Bakshi2009p110752009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf
Files
(3.3 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:1cc8bbfc856fd9ab9b2f317de1adbb03
|
3.3 MB | Preview Download |
Additional details
- Eprint ID
- 19434
- Resolver ID
- CaltechAUTHORS:20100816-092052973
- CCF-0325324
- NSF
- W911NF-07-I0029
- Defense Advanced Research Projects Agency (DARPA)
- 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
- 10842438