Fundamental Limits of Communication With Low Probability of Detection
Name
1506.03236.pdf
Description
Accepted version
Size
913.65 KB
Format
Adobe PDF
Checksum (MD5)
ac9e601cebcb71ef473f4cca0c9ac9f2
Author(s) • •
Wang, Ligong
Wornell, Gregory W.
Zheng, Lizhong
Date Issued
June 2016
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Wang, Ligong, Wornell, Gregory W. and Zheng, Lizhong. 2016. "Fundamental Limits of Communication With Low Probability of Detection." 62 (6).
Version
Author's final manuscript
Abstract
© 2016 IEEE. This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low. In particular, the relative entropy between the output distributions when a codeword is transmitted and when no input is provided to the channel must be sufficiently small. For a DMC whose output distribution induced by the "off" input symbol is not a mixture of the output distributions induced by other input symbols, it is shown that the maximum amount of information that can be transmitted under this criterion scales like the square root of the blocklength. The same is true for the AWGN channel. Exact expressions for the scaling constant are also derived.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tit.2016.2548471