Quadratically Constrained Twoway Adversarial Channels
Zhang, Yihan and Vatedka, Shashank and Jaggi, Sidharth (2020) Quadratically Constrained Twoway Adversarial Channels. In: 2020 IEEE International Symposium on Information Theory, ISIT 2020, 21 July 2020through 26 July 2020, Los Angeles.
Text
Quadratically_Constrained_Twoway_Adversarial_Channels.pdf  Published Version Available under License Creative Commons Attribution. Download (513kB) 
Abstract
We study achievable rates of reliable communication in a powerconstrained twoway additive interference channel over the real alphabet where communication is disrupted by a powerconstrained jammer. This models the wireless communication scenario where two users Alice and Bob, operating in the full duplex mode, wish to exchange messages with each other in the presence of a jammer, James. Alice and Bob simultaneously transmit their encodings x A and x B over n channel uses. It is assumed that James can choose his jamming signal s as a noncausal randomized function of x A + x B , and the codebooks used by Alice and Bob. Alice and Bob observe x A + x B + s, and must recover each others' messages reliably. In this article, we provide upper and lower bounds on the capacity of this channel which match each other and equal \frac{1}{2}\log \left( {\frac{1}{2} + SNR} \right) in the high SNR regime (where SNR, signal to noise ratios, is defined as the ratio of the power constraints of the users to the power constraint of the jammer). We give a code construction based on lattice codes, and derive achievable rates for large SNR. We also present upper bounds based on two specific attack strategies for James. Along the way, sumset property of lattices for the achievability and general properties of capacityachieving codes for memoryless channels for the converse are proved, which might be of independent interest. The full version of this paper is [1]. © 2020 IEEE.
[error in script]IITH Creators: 



Item Type:  Conference or Workshop Item (Paper)  
Uncontrolled Keywords:  Additive interference; Attack strategies; Full duplex modes; Memoryless channels; Power constraints; Reliable communication; Upper and lower bounds; Wireless communications  
Subjects:  Electrical Engineering  
Divisions:  Department of Electrical Engineering  
Depositing User:  . LibTrainee 2021  
Date Deposited:  18 Nov 2022 15:18  
Last Modified:  18 Nov 2022 15:18  
URI:  http://raiith.iith.ac.in/id/eprint/11307  
Publisher URL:  http://doi.org/10.1109/ISIT44484.2020.9174421  
Related URLs: 
Actions (login required)
View Item 
Statistics for this ePrint Item 