Wire-tap channel II
Wire-tap channel II
复制标题
DOI：
10.1007/3-540-39757-4_5
复制
发表时间：
1984-12
期刊：
影响因子：
--
通讯作者：
L. Ozarow;A. Wyner
中科院分区：
文献类型：
--
作者：
L. Ozarow;A. Wyner
考虑以下情况。K个数据比特将被编码成N> K个比特，并在无噪声信道上传输。入侵者可以观察到他选择的大小为μ < N的子集。该编码器被设计为最大化入侵者的不确定性的数据给定他的μ截获的信道位，受的条件是，预期的接收器可以恢复K个数据位完美地从N个信道位。在参数K、N和μ以及入侵者的不确定性H（H是给定μ截获的信道比特的数据的“条件熵”）之间找到了最佳折衷。特别地，当μ = N-K时，存在一个H <$K-l的系统。因此，例如，当N = 2K并且μ = K时，可以将K个数据比特编码成2K个信道比特，使得通过查看任何K个信道比特，入侵者获得不超过一个比特的数据。
Consider the following situation. K data bits are to be encoded into N> K bits and transmitted over a noiseless channel. An intruder can observe a subset of his choice of size μ < N. The encoder is to be designed to maximize the intruder's uncertainty about the data given his μ intercepted channel bits, subject to the condition that the intended receiver can recover the K data bits perfectly from the N channel bits. The optimal trade-offs among the parameters K, N, and μ and the intruder's uncertainty H (H is the "conditional entropy" of the data given the μ intercepted channel bits) were found. In particular, it was shown that for μ = N − K, a system exists with H ≈ K − l. Thus, for example, when N = 2K and μ = K, it is possible to encode the K data bits into 2K channel bits, so that by looking at any K channel bits, the intruder obtains no more than one bit of the data.