Finite Blocklength Covert Communication over Quasi-Static Multiple-Antenna Fading Channels
Changhong Liu, Jingjing Wang, Qiaosheng Zhang, Jinpeng Xu, Lin Zhou

TL;DR
This paper investigates the finite blocklength performance of optimal codes for covert communication over quasi-static multi-antenna fading channels, revealing the square root law scaling and significant spatial diversity gains.
Contribution
It extends covert communication analysis to fading channels, demonstrating the impact of channel state information and multiple antennas on covert rate performance.
Findings
Covert rate scales as Θ(n^{-1/2}) with blocklength n.
Multiple antennas provide significant spatial diversity gains.
CSI availability at legitimate users does not affect finite blocklength covert performance.
Abstract
The white book released by the International Telecommunications Union (ITU) calls for extremely high-security and low-latency communication over fading channels. Under the low-latency requirement, the corresponding fading model is quasi-static fading while high-security can be achieved via covert communication. In response to the call of ITU, we study the finite blocklength performance of optimal codes for covert communication over quasi-static multi-antenna fading channels, under the covertness metric of Kullback-Leibler (KL) divergence. In particular, we study all four cases regarding the availability of channel state information (CSI) for legitimate transmitter and receiver, and assume that the warden knows perfect CSI for the channel from the legitimate transmitter to itself. Specifically, we show that, when the blocklength is , the first-order covert rate satisfies the square…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
