Fundamental Limits of Communication With Low Probability of Detection

Fundamental Limits of Communication With Low Probability of Detection
复制标题

DOI:
10.1109/tit.2016.2548471
复制
发表时间:
2016-06-01
影响因子:
2.5
通讯作者:
Zheng, Lizhong
Zheng, Lizhong
中科院分区:
计算机科学2区
文献类型:
--
作者:
Wang, Ligong;Wornell, Gregory W.;Zheng, Lizhong

文献摘要

被引文献

相似文献

本文考虑离散无记忆信道(DMC)或加性高斯白噪声(AWGN)信道上的通信问题,约束条件是观察信道输出的敌手能够检测到通信的概率很低。具体地,当发送码字时和当没有向信道提供输入时,输出分布之间的相对熵必须足够小。对于由“OFF”输入符号引起的输出分布不是由其他输入符号引起的输出分布的混合的DMC,证明了在该准则下可以传输的最大信息量与块长度的平方根成正比。AWGN通道也是如此。给出了标度常数的精确表达式。
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.