Name
Abstract | ||
|---|---|---|
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 ${\\bf x}=(x_{1}, \\dots, 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 \\leq i$. This is in contrast to the “classical” adversarial jamming situations in which the jammer has no knowledge of ${\\bf x}$, or knows ${\\bf 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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TIT.2013.2245721 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
channel capacity,encoding,jamming,stochastic processes,adversarial jammer,adversarial jamming,binary channels capacity,causal adversaries,codeword,communication channel,information communication,stochastic encoding schemes,Arbitrarily varying channels (AVCs),channel coding,jamming | Journal | 59 |
Issue | ISSN | Citations |
6 | 0018-9448 | 11 |
PageRank | References | Authors |
0.62 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bikash Kumar Dey | 1 | 185 | 27.07 |
| Sidharth Jaggi | 2 | 977 | 92.83 |
| Michael Langberg | 3 | 867 | 65.83 |
| Anand D. Sarwate | 4 | 45 | 7.14 |