WIRE-TAP CHANNEL
WIRE-TAP CHANNEL
复制标题
DOI：
10.1002/j.1538-7305.1975.tb02040.x
复制
发表时间：
1975-01-01
影响因子：
--
通讯作者：
WYNER, AD
中科院分区：
文献类型：
--
作者：
WYNER, AD
我们考虑的情况下，数字数据是可靠地传输在离散的，无记忆的信道（DMC），是在接收器进行线抽头。我们假设窃听器通过第二个DMC查看通道输出。允许发射机进行编码和接收机进行解码。然而，这些操作中使用的代码本被假定为攻丝工已知。设计者试图以这样的方式构建编码器-解码器，以最大化传输速率R，以及由线攻丝机看到的数据的模糊度d。在本文中，我们找到了R和d之间的权衡曲线，假设基本上是完美的（“无误差”）传输。特别地，如果d等于H s，即数据源的熵，则我们认为传输是在完全保密的情况下完成的。我们的结果意味着，存在一个C8> 0，这样，在接近完美的保密性，可靠的传输速率高达CS是可能的。
We consider the situation in which digital data is to be reliably transmitted over a discrete, memoryless channel (DMC) that is subjected to a wire‐tap at the receiver. We assume that the wire‐tapper views the channel output via a second DMC. Encoding by the transmitter and decoding by the receiver are permitted. However, the code books used in these operations are assumed to be known by the wire‐tapper. The designer attempts to build the encoder‐decoder in such a way as to maximize the transmission rate R, and the equivocation d of the data as seen by the wire‐tapper. In this paper, we find the trade‐off curve between R and d, assuming essentially perfect (“error‐free”) transmission. In particular, if d is equal to H s, the entropy of the data source, then we consider that the transmission is accomplished in perfect secrecy. Our results imply that there exists a C8> 0, such that reliable transmission at rates up to CS is possible in approximately perfect secrecy.