Ozarow-type outer bounds for memoryless sources and channels
Name
isit18_ozarow.pdf
Description
Accepted version
Size
84.02 KB
Format
Adobe PDF
Checksum (MD5)
4a262d0878397fbc404c0e699280c767
Author(s)
Kochman, Yuval
Ordentlich, Or
Polyanskiy, Yury
Date Issued
August 2018
Journal
IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Kochman, Yuval, Or Ordentlich, and Yury Polyanskiy, "Ozarow-type outer bounds for memoryless sources and channels." 2018 IEEE International Symposium on Information Theory (ISIT 2018 Vail), Vail, Colorado, June 17-22, 2018 (Piscataway, N.J.: IEEE, 2018): doi 10.1109/ISIT.2018.8437864 ©2018 Author(s)
Version
Author's final manuscript
Abstract
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. ©2018 IEEE
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2018.8437864
