Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
复制标题
DOI：
10.1109/tit.2013.2245721
复制
发表时间：
2013-06-01
影响因子：
2.5
通讯作者：
Sarwate, Anand D.
中科院分区：
文献类型：
--
作者：
Dey, Bikash Kumar;Jaggi, Sidharth;Sarwate, Anand D.
在这篇文章中，我们考虑了存在因果对抗干扰时的信息通信问题。在所研究的设置中，发送者希望通过在通信信道上逐位发送码字x=(x(1)，...，x(N))来将消息传送给接收者。发送者和接收者不共享共同的随机性。对抗性干扰机可以一次查看传输的比特x(I)中的一个，并且可以改变它们中的p个分数。然而，干扰器的决定必须以因果关系的方式做出。也就是说，对于每个比特x(I)，干扰器关于是否破坏它的决定必须仅取决于j的x(j
In this paper, 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 sender and the receiver do not share common randomness. 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 a causal manner. Namely, for each bit x(i), the jammer's decision on whether to corrupt it or not must depend only on x(j) for j