Ozarow-type outer bounds for memoryless sources and channels
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....
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2020
|
| Online Access: | https://hdl.handle.net/1721.1/124442 |
| _version_ | 1811088054745563136 |
|---|---|
| author | Kochman, Yuval Ordentlich, Or Polyanskiy, Yury |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Kochman, Yuval Ordentlich, Or Polyanskiy, Yury |
| author_sort | Kochman, Yuval |
| collection | MIT |
| description | 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 |
| first_indexed | 2024-09-23T13:55:32Z |
| format | Article |
| id | mit-1721.1/124442 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T13:55:32Z |
| publishDate | 2020 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1244422022-10-01T18:01:53Z Ozarow-type outer bounds for memoryless sources and channels Kochman, Yuval Ordentlich, Or Polyanskiy, Yury Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 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 National Science Foundation CAREER Award (Grant CCF-12-53205) NSF (Grant CCF-17-17842) Center for Science of Information, NSF (Grant agreement CCF-09-39370) 2020-03-31T13:36:33Z 2020-03-31T13:36:33Z 2018-08 2018-06 2019-07-01T18:05:05Z Article http://purl.org/eprint/type/ConferencePaper 978-1-5386-4781-3 978-1-5386-4102-6 2157-8117 https://hdl.handle.net/1721.1/124442 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) en 10.1109/ISIT.2018.8437864 IEEE International Symposium on Information Theory Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Kochman, Yuval Ordentlich, Or Polyanskiy, Yury Ozarow-type outer bounds for memoryless sources and channels |
| title | Ozarow-type outer bounds for memoryless sources and channels |
| title_full | Ozarow-type outer bounds for memoryless sources and channels |
| title_fullStr | Ozarow-type outer bounds for memoryless sources and channels |
| title_full_unstemmed | Ozarow-type outer bounds for memoryless sources and channels |
| title_short | Ozarow-type outer bounds for memoryless sources and channels |
| title_sort | ozarow type outer bounds for memoryless sources and channels |
| url | https://hdl.handle.net/1721.1/124442 |
| work_keys_str_mv | AT kochmanyuval ozarowtypeouterboundsformemorylesssourcesandchannels AT ordentlichor ozarowtypeouterboundsformemorylesssourcesandchannels AT polyanskiyyury ozarowtypeouterboundsformemorylesssourcesandchannels |