DocumentCode :
3662996
Title :
On adversarial joint source channel coding
Author :
Arya Mazumdar;Ankit Singh Rawat
Author_Institution :
Department of ECE, University of Minnesota - Twin Cities, Minneapolis, 55455, United States
fYear :
2015
fDate :
6/1/2015 12:00:00 AM
Firstpage :
271
Lastpage :
275
Abstract :
In a joint source-channel coding scheme, a single mapping is used to perform both the tasks of data compression and channel coding in a combined way, rather than performing them separately. Usually for simple iid sources and channels, separation of the tasks is information theoretically optimal. In an adversarial joint source-channel coding scenario, instead of a stochastic channel, an adversary introduces a set of bounded number of errors/erasures. It has been shown recently that, even in the simplest cases of such adversarial models, separation is suboptimal and characterizing the fundamental limits is difficult. In this paper, we study several properties of such adversarial joint source-channel schemes. We show optimality of separation in some situations, provide simple joint schemes that beat separation in others, and give new bounds on the rate of such coding.
Keywords :
"Distortion","Decoding","Joints","Channel coding","Measurement"
Publisher :
ieee
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
Type :
conf
DOI :
10.1109/ISIT.2015.7282459
Filename :
7282459
Link To Document :
بازگشت