Work

Second-Order Asymptotics for Covert Communication over MIMO AWGN Channels

Year: 2026
Type: conference-paper
Abstract: As claimed in International Telecommunications Union (ITU) Recommendation ITU-R M.2160, 6G communication systems require extremely high-security and low-latency communication, necessitating the study of covert communication operating at finite blocklengths. In the point-to-point (P2P) setting, covert communication enables a transmitter to send messages reliably over a noisy channel to a legitimate receiver without being detected by any third party. Under the covertness metric of Kullback–Leibler divergence (KLD), we derive exact second-order asymptotics for P2P covert communication over a multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channel. In particular, our theoretical benchmarks refine the first-order asymptotics of Wang and Bloch (TIFS 2021), which is known as the square root law by showing that the non-asymptotic maximal number of transmitted messages has a back off that scales in the order \(\Theta(n^\frac{1}{4})\) beyond the first-order term scaling in the order \(\Theta(n^\frac{1}{2})\) when the blocklength is \(n\). Thus, our second-order asymptotic bound provides a better approximation to the finite blocklength performance of optimal codes. Furthermore, compared with the single antenna result of Yu et al. (arXiv:2305.17924v3), we demonstrate the impact of the number of antennas \(m\) and reveal spatial diversity gains of MIMO, advocating the use of MIMO for covert communication to achieve a high transmission rate. To prove our results, we extend the quasi-\(\eta\)-neighborhood framework from single-antenna real value channels to multi-antenna complex value MIMO channels. To ensure covertness, the transmission power vanishes as the blocklength \(n\) increases. Thus, we judiciously analyze the finite blocklength performance of MIMO communication by modifying critical steps concerning the Berry–Esseen Theorem to deal with vanishing second and third absolute moments of information densities that rely on blocklength, which is in stark contrast with the non-covert case.
Open Access status: gold
OpenAlex ID: W7123472046
FWCI:
Cites:
Cited by:
Related to: