Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 163

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Gaussian Signalling for Covert Communications

Open access
Yan, Shihao, Cong, Yirui, Hanly, Stephen V., Zhou, Xiangyun · 2019 · IEEE Transactions on Wireless Communications

Abstract

In this paper, we examine the optimality of Gaussian signalling for covert communications with an upper bound on D(p1||p0) or D(p0||p1) as the covertness constraint, where D(p1||p0) and D(p0||p1) are different due to the asymmetry of Kullback-Leibler divergence, p0(y) and p1(y) are the likelihood functions of the observation y at the warden under the null hypothesis (no covert transmission) and alternative hypothesis (a covert transmission occurs), respectively. Considering additive white Gaussian noise at both the receiver and the warden, we prove that the Gaussian signalling is optimal in terms of maximizing the mutual information of transmitted and received signals for covert communications with an upper bound on D(p1||p0) as the constraint. More interestingly, we also prove that the Gaussian signalling is not optimal for covert communications with an upper bound on D(p0||p1) as the constraint, for which as we explicitly show skew-normal signalling can outperform the Gaussian signalling in terms of achieving higher mutual information. Finally, we prove that, for Gaussian signalling, an upper bound on D(p1||p0) is a tighter covertness constraint in that it leads to lower mutual information than the same upper bound on D(p0||p1), by proving D(p0||p1) ≤ D(p1||p0).

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/twc.2019.2915305

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 163

Metadata

Authors
Yan, S., Cong, Y., Hanly, S. V., & Zhou, X.
Venue
IEEE Transactions on Wireless Communications
Published
2019-07
Volume
18
Issue
7
Pages
3542-3553
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W2809857136
Cited by
163
References
1
FWCI
6.61
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.