DocumentCode :
3662994
Title :
Converse and duality results for combinatorial source-channel coding in binary Hamming spaces
Author :
Andrew J. Young;Yury Polyanskiy
Author_Institution :
Department of Electrical Engineering and Computer, Science, MIT, Cambridge, MA 02139 USA
fYear :
2015
fDate :
6/1/2015 12:00:00 AM
Firstpage :
261
Lastpage :
265
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 ρ.
Keywords :
"Distortion","Bandwidth","Encoding","Decoding","Joints","Upper bound","Hamming distance"
Publisher :
ieee
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
Type :
conf
DOI :
10.1109/ISIT.2015.7282457
Filename :
7282457
Link To Document :
بازگشت