论文标题
成本约束窃听通道的保密能力
The Secrecy Capacity of Cost-Constrained Wiretap Channels
论文作者
论文摘要
在许多信息理论的通道编码问题中，将输入成本限制添加到操作设置中等同于限制容量公式中的优化域。本文表明，与普遍的信念相比，这种简单的修改不适合成本约束（CC）窃听通道（WTC）。单个辅助随机变量描述了离散无内存（DM）WTC的保密容量。但是，对于CC DM-WTC，我们表明有两个辅助因素才能实现能力。具体而言，我们首先得出了秘密容量公式，通过叠加编码证明了直接部分。然后，我们提供了一个CC DM-WTC的示例，其秘密容量无法使用单个辅助功能来实现。这确立了对CC WTC上叠加编码的基本作用。
In many information-theoretic channel coding problems, adding an input cost constraint to the operational setup amounts to restricting the optimization domain in the capacity formula. This paper shows that, in contrast to common belief, such a simple modification does not hold for the cost-constrained (CC) wiretap channel (WTC). The secrecy-capacity of the discrete memoryless (DM) WTC without cost constraints is described by a single auxiliary random variable. For the CC DM-WTC, however, we show that two auxiliaries are necessary to achieve capacity. Specifically, we first derive the secrecy-capacity formula, proving the direct part via superposition coding. Then, we provide an example of a CC DM-WTC whose secrecy-capacity cannot be achieved using a single auxiliary. This establishes the fundamental role of superposition coding over CC WTCs.
