| dc.contributor.author | Kochman, Yuval | |
| dc.contributor.author | Ordentlich, Or | |
| dc.contributor.author | Polyanskiy, Yury | |
| dc.date.accessioned | 2020-03-31T13:36:33Z | |
| dc.date.available | 2020-03-31T13:36:33Z | |
| dc.date.issued | 2018-08 | |
| dc.date.submitted | 2018-06 | |
| dc.identifier.isbn | 978-1-5386-4781-3 | |
| dc.identifier.isbn | 978-1-5386-4102-6 | |
| dc.identifier.issn | 2157-8117 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/124442 | |
| dc.description.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 | en_US |
| dc.description.sponsorship | National Science Foundation CAREER Award (Grant CCF-12-53205) | en_US |
| dc.description.sponsorship | NSF (Grant CCF-17-17842) | en_US |
| dc.description.sponsorship | Center for Science of Information, NSF (Grant agreement CCF-09-39370) | en_US |
| dc.language.iso | en | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
| dc.relation.isversionof | 10.1109/ISIT.2018.8437864 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Ozarow-type outer bounds for memoryless sources and channels | en_US |
| dc.type | Article | en_US |
| dc.identifier.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) | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.relation.journal | IEEE International Symposium on Information Theory | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2019-07-01T18:05:05Z | |
| dspace.date.submission | 2019-07-01T18:05:06Z | |
| mit.journal.volume | 2018 | en_US |
| mit.metadata.status | Complete | |
