Record Details

Upper Bounds on the Capacity of Binary Channels With Causal Adversaries

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
 
Creator DEY, BK
JAGGI, S
LANGBERG, M
SARWATE, AD
 
Subject Arbitrarily varying channels (AVCs)
channel coding
jamming
PROBABILITY FUNCTIONS
CODES
COMMUNICATION
DISTANCE
 
Description 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
 
Publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
 
Date 2014-10-16T14:35:14Z
2014-10-16T14:35:14Z
2013
 
Type Article
 
Identifier IEEE TRANSACTIONS ON INFORMATION THEORY, 59(6)3753-3763
http://dx.doi.org/10.1109/TIT.2013.2245721
http://dspace.library.iitb.ac.in/jspui/handle/100/15798
 
Language en