Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
Alice wishes to transmit a message u to Bob over a binary-input binary-output channel. To do so, she encodes u into a length-n binary vector x and transmits it over the channel. However, the channel is controlled by a malicious adversary Calvin who may observe the transmissions, and attempts to jam communication by flipping up to a p fraction of the bits transmitted by Alice. In this paper, the authors consider the communication of information in the presence of a causal adversarial jammer.