Show simple item record

dc.contributor.authorYoung, Andrew J.
dc.contributor.authorPolyanskiy, Yury
dc.date.accessioned2016-01-27T18:03:28Z
dc.date.available2016-01-27T18:03:28Z
dc.date.issued2015-06
dc.identifier.isbn978-1-4673-7704-1
dc.identifier.urihttp://hdl.handle.net/1721.1/101007
dc.description.abstractThis article continues the recent investigation of combinatorial joint source-channel coding. For the special case of a binary source and channel subject to distortion measured by Hamming distance, the lower (converse) bounds on achievable source distortion are improved for all values of channel noise. Operational duality between coding with bandwidth expansion factors ρ and 1 over ρ is established. Although the exact value of the asymptotic noise-distortion tradeoff curve is unknown (except at ρ = 1), some initial results on inter-relations between these curves for different values of ρ are shown and lead to statements about monotonicity and continuity in ρ.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-13-18620)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ISIT.2015.7282457en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleConverse and duality results for combinatorial source-channel coding in binary Hamming spacesen_US
dc.typeArticleen_US
dc.identifier.citationYoung, Andrew J., and Yury Polyanskiy. “Converse and Duality Results for Combinatorial Source-Channel Coding in Binary Hamming Spaces.” 2015 IEEE International Symposium on Information Theory (ISIT) (June 2015).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorYoung, Andrew J.en_US
dc.contributor.mitauthorPolyanskiy, Yuryen_US
dc.relation.journalProceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsYoung, Andrew J.; Polyanskiy, Yuryen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-2109-0979
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record