← 研踪 PaperTrailarXiv:2305.17924 · v8
First- and Second-Order Bounds for Covert Communication Over AWGN Channels
首次提交 2023-05-29 15:32
版本更新 2026-11-13 09:06
雷达观测 2026-11-17 04:57
摘要
This paper investigates the first- and second-order asymptotic behavior of covert communication over additive white Gaussian noise (AWGN) channels under a Kullback--Leibler (KL) divergence covertness constraint. We derive explicit achievable first- and second-order throughput terms and a converse bound in terms of the blocklength, decoding error probability, adversary noise variance, and covertness constraint. The achievability analysis employs truncated Gaussian random coding with an arbitrary fixed parameter , a common decoding threshold accommodating codewords with different energies, and expurgation to meet a maximal-error reliability requirement. We also establish sufficient secret-key sizes and identify the dependence of key consumption on the adversary noise variance and . Both throughput bounds exhibit first-order and second-order scalings. Although their coefficients differ for each fixed , the ratio of the achievable to converse first-order coefficients equals . Thus, choosing a fixed arbitrarily close to one makes the first-order coefficient gap arbitrarily small. The results quantify the tradeoffs among throughput, reliability, covertness, and secret-key resources in finite-blocklength AWGN covert communication.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v8 · 2026-11-13 09:06 · 最新观测版本
First- and Second-Order Bounds for Covert Communication Over AWGN Channels
This paper investigates the first- and second-order asymptotic behavior of covert communication over additive white Gaussian noise (AWGN) channels under a Kullback--Leibler (KL) divergence covertness constraint. We derive explicit achievable first- and second-order throughput terms and a converse bound in terms of the blocklength, decoding error probability, adversary noise variance, and covertness constraint. The achievability analysis employs truncated Gaussian random coding with an arbitrary fixed parameter , a common decoding threshold accommodating codewords with different energies, and expurgation to meet a maximal-error reliability requirement. We also establish sufficient secret-key sizes and identify the dependence of key consumption on the adversary noise variance and . Both throughput bounds exhibit first-order and second-order scalings. Although their coefficients differ for each fixed , the ratio of the achievable to converse first-order coefficients equals . Thus, choosing a fixed arbitrarily close to one makes the first-order coefficient gap arbitrarily small. The results quantify the tradeoffs among throughput, reliability, covertness, and secret-key resources in finite-blocklength AWGN covert communication.
查看此版本解读 →查看此版本原文 ↗