TY - GEN
T1 - Quadratically Constrained Myopic Adversarial Channels
AU - Zhang, Yihan
AU - Vatedka, Shashank
AU - Jaggi, Sidharth
AU - Sarwate, Anand D.
N1 - Funding Information:
1This work was partially funded by a grant from the University Grants Committee of the HKSAR (Project No. AoE/E-02/08) and RGC GRF grants 14208315 and 14313116. The work of Shashank Vatedka was supported in part by CUHK Direct Grants 4055039 and 4055077.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - We study communication in the presence of a jamming adversary where quadratic power constraints are imposed on the transmitter and the jammer. The jamming signal is assumed to be a function of the codebook, and a noncausal but noisy observation of the transmitted codeword. For a certain range of the noise-to-signal ratios (NSRs) of the transmitter and the jammer, we are able to characterize the capacity of this channel under deterministic encoding. For the remaining NSR regimes, we determine the capacity under the assumption of a small amount of common randomness (at most \mathcal{O}(\log(n)) bits in one sub-regime, and at most \mathcal{O}(n) bits in the other sub-regime) available to the encoder-decoder pair. Our proof techniques include a novel myopic list-decoding result for achievability and a Plotkin-type push attack for the converse in a subregion of the NSRs, which may be of independent interest. A short video explaining our work is available at https://youtu.be/0015-W-xhLM.
AB - We study communication in the presence of a jamming adversary where quadratic power constraints are imposed on the transmitter and the jammer. The jamming signal is assumed to be a function of the codebook, and a noncausal but noisy observation of the transmitted codeword. For a certain range of the noise-to-signal ratios (NSRs) of the transmitter and the jammer, we are able to characterize the capacity of this channel under deterministic encoding. For the remaining NSR regimes, we determine the capacity under the assumption of a small amount of common randomness (at most \mathcal{O}(\log(n)) bits in one sub-regime, and at most \mathcal{O}(n) bits in the other sub-regime) available to the encoder-decoder pair. Our proof techniques include a novel myopic list-decoding result for achievability and a Plotkin-type push attack for the converse in a subregion of the NSRs, which may be of independent interest. A short video explaining our work is available at https://youtu.be/0015-W-xhLM.
UR - http://www.scopus.com/inward/record.url?scp=85052434831&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85052434831&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437457
DO - 10.1109/ISIT.2018.8437457
M3 - Conference contribution
AN - SCOPUS:85052434831
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 611
EP - 615
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -