跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+816新增论文
+642其中 AI 相关
+95已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 12:54 — 2026-11-21 12:54(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v8arXiv:2305.17924

First- and Second-Order Bounds for Covert Communication Over AWGN Channels

Xinchun Yu, Chenhao Ying, Shuangqing Wei, Xiao-Ping Zhang

原文摘要

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 $μ\in(1/2,1)$, 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 $O(\sqrt{n})$ first-order and $O(n^{1/4})$ second-order scalings. Although their coefficients differ for each fixed $μ<1$, 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.

cs.IT