arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.05071cs.ITmath.IT
收藏

低检测概率通信的有限块长度可扩展性界

A Finite Block Length Achievability Bound for Low Probability of Detection Communication

Nick Letzepis

摘要:

低检测概率(或隐蔽)通信是指信息必须可靠地发送到接收方,但被对手检测到的概率很低的情况。最近的工作,这个通信问题的基本限制已经建立了可扩展性和逆界是渐近的块长度的代码。本文利用Gallager的随机编码界,推导出一个新的可扩展性界,适用于有限块长度体制下的低检测概率通信。进一步的见解,否则隐藏在以前的渐近分析被揭露。

英文摘要:

Low probability of detection (or covert) communication refers to the scenario where information must be sent reliably to a receiver, but with low probability of detection by an adversary. Recent works on the fundamental limits of this communication problem have established achievability and converse bounds that are asymptotic in the block length of the code. This paper uses Gallager's random coding bound to derive a new achievability bound that is applicable to low probability of detection communication in the finite block length regime. Further insights are unveiled that are otherwise hidden in previous asymptotic analyses.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑