Limits of low-probability-of-detection communication over a discrete memoryless channel
Authors:
- 1 June 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2525-2529
Abstract
This paper considers the problem of communication over a discrete memoryless channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low. Specifically, 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 channel whose output distribution induced by the zero input symbol is not a mixture of the output distributions induced by other input symbols, it is shown that the maximum number of bits that can be transmitted under this criterion scales like the square root of the blocklength. Exact expressions for the scaling constant are also derived.Keywords
This publication has 18 references indexed in Scilit:
- Limits of Reliable Communication with Low Probability of Detection on AWGN ChannelsIEEE Journal on Selected Areas in Communications, 2013
- Reliable deniable communication: Hiding messages in noise2013
- Channel Coding Rate in the Finite Blocklength RegimeIEEE Transactions on Information Theory, 2010
- Simple channel coding bounds2009
- Information projections revisitedIEEE Transactions on Information Theory, 2003
- Information-Spectrum Methods in Information Theory2003
- An Information-Theoretic Model for Steganography1998
- A general formula for channel capacityIEEE Transactions on Information Theory, 1994
- The Wire-Tap ChannelBell System Technical Journal, 1975
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948