Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarow's technique for establishing impossibility results, and extend it to general sources and distortion measures. For the problem of sending a source over a broadcast channel, we revisit the bounding technique of Reznik, Feder and Zamir, and extend it to general sources, distortion measures and broadcast channels. Although the obtained bounds do not improve over existing results in the literature, they are relatively easy to evaluate, and their derivation reveals the similarities between the two bounding techniques.
|Original language||American English|
|Title of host publication||2018 IEEE International Symposium on Information Theory, ISIT 2018|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|State||Published - 15 Aug 2018|
|Event||2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States|
Duration: 17 Jun 2018 → 22 Jun 2018
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Conference||2018 IEEE International Symposium on Information Theory, ISIT 2018|
|Period||17/06/18 → 22/06/18|
Bibliographical noteFunding Information:
The work of Y. Kochman was supported in part by the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office. The work of O. Ordentlich was supported by ISF under Grant 1791/17. The work of Y. Polyanskiy was supported in part by the National Science Foundation CAREER award under grant agreement CCF-12-53205, an NSF grant CCF-17-17842 and by the Center for Science of Information (CSoI), an NSF Science and Technology Center, under grant agreement CCF-09-39370
© 2018 IEEE.