Channel Resolvability with a Full-Duplex Decode-and-Forward Relay

Treating Interference as Noise is Optimal for Covert Communication over Interference Channels

“…The fundamental limits of covert communications have been actively studied mainly for pointto-point (p-to-p) channels such as additive white Gaussian noise (AWGN) channels [2], [3], discrete memoryless channels (DMCs) [3], [4], low-complexity coding scheme based on the pulse-position modulation [5], [6], channels using multiple antennas [7], and channels with some uncertainty of statistics [8], [9]. In most interesting cases, the covertness constraint restricts the number of no "off" input symbols (for discrete channel cases [4]) or the transmit power (for continuous channel cases [2], [3]) that leads the so-called square-root law, i.e., the maximum number of bits that can be communicated reliably and covertly over n channel uses scales proportionally to √ n. Recently, this line of research has been extended to various network scenarios such as multiple access channels (MACs) [10], broadcast channels (BCs) [11], relay channels (RCs) [12]- [14], and wireless adhoc networks [15]. It turns out that in some canonical models, the covertness constraint affects This paper was submitted to IEEE Transactions on Information Forensics and Security, and a shorter version of this paper was submitted to IEEE ISIT 2020 [1].…”