Fundamental Limits of Communication With Low Probability of Detection

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 rela...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 62; H. 6; S. 3493 - 3503
Hauptverfasser: Ligong Wang, Wornell, Gregory W., Lizhong Zheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.06.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Schlagworte:
AWGN channels
Blocking
Bulk molding compounds
Channels
Computer Science
Constants
covert communication
Criteria
Data transmission
Distributed processing
Entropy
Fisher information
Gaussian
Information Theory
information-theoretic security
Low probability of detection
Memoryless systems
Monte Carlo methods
Normal distribution
Receivers
Switches
Symbols
Transmitters
information-theoretic security
Low probability of detection
covert communication
Fisher information
covert communi-cation
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2016.2548471