Binary Causal-Adversary Channels

Details Binary Causal-Adversary Channels Binary Causal-Adversary Channels

2009-01-13

arxiv.org/abs/0901.1853v2

Computer Science

Information Theory

8 pages, 1 figure, extended version of paper submitted to the International Symposium on Information Theory, 2009 (ISIT2009)

Scientific paper

In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x=(x_1,...,x_n) bit-by-bit over a communication channel. The adversarial jammer can view the transmitted bits x_i one at a time, and can change up to a p-fraction of them. However, the decisions of the jammer must be made in an online or causal manner. Namely, for each bit x_i the jammer's decision on whether to corrupt it or not (and on how to change it) must depend only on x_j for j <= i. This is in contrast to the "classical" adversarial jammer which may base its decisions on its complete knowledge of x. We present a non-trivial upper bound on the amount of information that can be communicated. We show that the achievable rate can be asymptotically no greater than min{1-H(p),(1-4p)^+}. Here H(.) is the binary entropy function, and (1-4p)^+ equals 1-4p for p < 0.25, and 0 otherwise.

Affiliated with

Also associated with

No associations

Rating

Binary Causal-Adversary Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Binary Causal-Adversary Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary Causal-Adversary Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72486