TY - GEN
T1 - Square root law for communication with low probability of detection on AWGN channels
AU - Bash, Boulat A.
AU - Goeckel, Dennis
AU - Towsley, Don
PY - 2012
Y1 - 2012
N2 - We present a square root limit on low probability of detection (LPD) communication over additive white Gaussian noise (AWGN) channels. Specifically, if a warden has an AWGN channel to the transmitter with non-zero noise power, we prove that o(√n) bits can be sent from the transmitter to the receiver in n AWGN channel uses with probability of detection by the warden less than ε for any ε > 0, and, if a lower bound on the noise power on the warden's channel is known, then O(√n) bits can be covertly sent in n channel uses. Conversely, trying to transmit more than O(√n) bits either results in detection by the warden with probability one or a non-zero probability of decoding error as n → ∞. Further, we show that LPD communication on the AWGN channel allows one to send a nonzero symbol on every channel use, in contrast to what might be expected from the square root law found recently in image-based steganography.
AB - We present a square root limit on low probability of detection (LPD) communication over additive white Gaussian noise (AWGN) channels. Specifically, if a warden has an AWGN channel to the transmitter with non-zero noise power, we prove that o(√n) bits can be sent from the transmitter to the receiver in n AWGN channel uses with probability of detection by the warden less than ε for any ε > 0, and, if a lower bound on the noise power on the warden's channel is known, then O(√n) bits can be covertly sent in n channel uses. Conversely, trying to transmit more than O(√n) bits either results in detection by the warden with probability one or a non-zero probability of decoding error as n → ∞. Further, we show that LPD communication on the AWGN channel allows one to send a nonzero symbol on every channel use, in contrast to what might be expected from the square root law found recently in image-based steganography.
UR - http://www.scopus.com/inward/record.url?scp=84867496148&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867496148&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2012.6284228
DO - 10.1109/ISIT.2012.6284228
M3 - Conference contribution
AN - SCOPUS:84867496148
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 448
EP - 452
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -