期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 59, 期 6, 页码 3753-3763出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2013.2245721
关键词
Arbitrarily varying channels (AVCs); channel coding; jamming
资金
- ISF Grant [480/08]
- RGC GRF [412608, 412809]
- RGC AoE Grant of the Institute of Network Coding under the University Grant Committee of Hong Kong
- RGC AoE Grant of the Institute of Network Coding under the CUHK MoE-Microsoft Key Laboratory of Humancentric Computing and Interface Technologies
- RGC AoE Grant of the Institute of Network Coding under the Bharti Centre for Communication, IIT Bombay, India
- RGC AoE Grant of the Institute of Network Coding under the California Institute for Telecommunications and Information Technology (CALIT2), University of California, San Diego
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 <= i. This is in contrast to the classical adversarial jamming situations in which the jammer has no knowledge of x, or knows x completely. In this study, we present upper bounds (that hold under both the average and maximal probability of error criteria) on the capacity which hold for both deterministic and stochastic encoding schemes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据