J. H. Lee,1,2 W. A. Peebles,1 E. F. Jaeger,3 E. J. Doyle,1 N. C. Luhmann, Jr.,4 C. C. Petty,5 R. I. Pinsker,5 R. Prater,5 and T. L. Rhodes1 1Department of Electrical Engineering and Institute of Plasma and Fusion Research, University of California, Los Angeles, California 90095 2School of Electronic and Electrical Engineering, Hong-Ik University, Seoul 121-791, Korea 3Oak Ridge National Laborat...

We show that a certain type of quasi finite, conservative, ergodic , measure preserving transformation always has a maximal zero entropy factor, generated by predictable sets. We also construct a conservative, ergodic , measure preserving transformation which is not quasi finite; and consider distribution asymptotics of information showing that e.g. for Boole’s transformation, information is as...

We show that a certain type of quasi finite, conservative, ergodic , measure preserving transformation always has a maximal zero entropy factor, generated by predictable sets. We also construct a conservative, ergodic , measure preserving transformation which is not quasi finite; and consider distribution asymptotics of information showing that e.g. for Boole’s transformation, information is as...

A framework of analogy between wiretap channels (WTCs) and state-dependent point-to-point channels with noncausal encoder channel state information (referred to as Gelfand-Pinker channels (GPCs)) is proposed. A good (reliable and secure) sequence of wiretap codes is shown to induce a good (reliable) sequence of codes for a corresponding GPC. Consequently, the framework enables exploiting existi...

Abstract. We strengthen the usual Csiszár-Kullback-Pinsker inequality by allowing weights in the total variation norm; admissible weights depend on the decay of the reference probability measure. We use this result to derive transportation inequalities involving Wasserstein distances for various exponents: in particular, we recover the equivalence between a T1 inequality and the existence of a ...

In a premier paper on the information-theoretic analysis of a two-user cognitive interference channel (CIC) [1], Devroye et al. presented an achievable rate region for the two-user discrete memoryless CIC. The coding scheme proposed by Devroye et al. is correct but unfortunately some rate-terms in the derived achievable rate region are incorrect (in fact incomplete) because of occurring some mi...

E CONSTRUCT an asymptotically good family of W linear error-correcting codes that can be encoded and decoded in linear time. These codes can also be encoded by linear-size circuits of logarithmic depth, and decoded by circuits of logarithmic depth and size O(n1ogn). Our construction builds on a construction of linear-time decodable error-correcting codes by Sipser and Spielman [25], which also ...