Wire-Tap Channel II

  • L. H. Ozarow
  • A. D. Wyner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 209)


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 N 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 tradoffs between the parameters K, N, μ 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 HK − 1, 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 essentially no information about the data.


Technical Journal Intended Receiver Noiseless Channel Parity Deck 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    Wyner, A. D., “The Wire-Tap Channel,” BSTJ, 54, pp. 1355–1387, October 1975.MathSciNetGoogle Scholar
  2. [2]
    Gallager, R. G., Information Theory and Reliable Communication, Wiley, New York, 1968.zbMATHGoogle Scholar
  3. [3]
    Ozarow, L. H., and A. D. Wyner, “Wire-Tap Channel II”, to appear in AT&T Bell Laboratories Technical Journal.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • L. H. Ozarow
    • 1
  • A. D. Wyner
    • 1
  1. 1.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations