2021
DOI: 10.1109/tifs.2020.3032292
|View full text |Cite
|
Sign up to set email alerts
|

Finite Blocklength Analysis of Gaussian Random Coding in AWGN Channels Under Covert Constraint

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 13 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…considering the covert communication with short packets, [3] investigated the effective throughput of the system in additive white Gaussian noise (AWGN) channels. Similarly, [4] considered the achievability bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. In addition, [5], [6] investigated the throughput over quasi-static fading channels, revealing the fundamental difference in the design between the case of quasi-static fading channel and that of AWGN channel.…”
Section: Introductionmentioning
confidence: 99%
“…considering the covert communication with short packets, [3] investigated the effective throughput of the system in additive white Gaussian noise (AWGN) channels. Similarly, [4] considered the achievability bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. In addition, [5], [6] investigated the throughput over quasi-static fading channels, revealing the fundamental difference in the design between the case of quasi-static fading channel and that of AWGN channel.…”
Section: Introductionmentioning
confidence: 99%