Converse and duality results for combinatorial source-channel coding in binary Hamming spaces
Author(s)Young, Andrew J.; Polyanskiy, Yury
MetadataShow full item record
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 ρ.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)
Institute of Electrical and Electronics Engineers (IEEE)
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).
Author's final manuscript