Learn More
Let {(X,, Y,J}r= 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a sequence { 2k}, where zk E %, the reproduction alphabet. The average(More)
This paper generalizes Wyner's definition of common information of a pair of random variables to that of N random variables. We prove coding theorems that show the same operational meanings for the common information of two random variables generalize to that of N random variables. As a byproduct of our proof, we show that the Gray-Wyner source coding(More)
Gnsider the fdlowhg atuatian. K data tits me to be m d into N > K bits and transmitted ewer a noisela charmel. An inmckcanabsgvea subset cfhis cfiacecfsize p< N. The mder is to be designed to d m i z e the intruder's u n d n t y abcut the data given his N intercepted charmel bits, subject to the d t i m that the h e & Teceivez can recdg tbe K data bits(More)
The capacity and error exponent of the direct detection optical channel are considered. The channel input in a T-second interval is a waveform A(r), 0 5 t I T, which satisfies 0 I A(t) I A, and (l/r)],,%(t) dt I aA, 0 < IT 11. The channel output is a Poisson process with intensity parameter X(t) + he. 'The quantities A and CIA represent the peak and average(More)
Let {(X,, Y,J}r= 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a sequence { 2k}, where zk E %, the reproduction alphabet. The average(More)