The maximal covert throughput over AWGN channels has first-order asymptotics √(n δ log e) and second-order asymptotics √2 (n δ)^{1/4} (log e)^{3/4} Q^{-1}(ε).
Throughput Scaling of Covert Communication Over Wireless Adhoc Networks,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The First and Second-Order Asymptotics of Covert Communication over AWGN Channels
The maximal covert throughput over AWGN channels has first-order asymptotics √(n δ log e) and second-order asymptotics √2 (n δ)^{1/4} (log e)^{3/4} Q^{-1}(ε).