Converse and duality results for combinatorial source-channel coding in binary Hamming spaces
Name
Polyanskiy_Converse and.pdf
Size
289.82 KB
Format
Adobe PDF
Checksum (MD5)
3b4b268bb2ae42ceae967410636b563c
Author(s)
Young, Andrew J.
Polyanskiy, Yury
Date Issued
June 2015
Journal
Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Young, 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).
Version
Author's final manuscript
Abstract
This 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 ρ.
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.2015.7282457
