Ozarow-type outer bounds for memoryless sources and channels
Author(s)
Kochman, Yuval; Ordentlich, Or; Polyanskiy, Yury
DownloadAccepted version (84.02Kb)
Terms of use
Metadata
Show full item recordAbstract
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
Date issued
2018-08Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
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
ISBN
978-1-5386-4781-3
978-1-5386-4102-6
ISSN
2157-8117