Previous works established the capacity region for some special cases of discrete memoryless degraded cognitive interference channel (CIC) with unidirectional destination cooperation (UDC). In this letter, we characterize the capacity region of the general discrete memoryless degraded CIC-UDC. The obtained results imply that the capacity region is achieved by the Gel’fand-Pinsker coding at the ...

F. Pinsker,1,* W. Bao,2 Y. Zhang,3,4 H. Ohadi,5 A. Dreismann,5 and J. J. Baumberg5 1Department of Physics, Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, United Kingdom 2Department of Mathematics, National University of Singapore, 119076 Singapore 3Beijing Computational Science Research Center, Beijing 100094, People’s Republic of China 4Université de Rennes 1, IRMAR, C...

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels (IC) where one transmitter knows both messages. The transmitter with this extra message knowledge is referred to as being cognitive. The inner bound is based on strategies that generalise prior work, and includes rate-splitting, Gel’fand–Pinsker (GP) coding and cooperative transmissio...

The notion of typical sequences plays a key role in the theory of information. Central to the idea of typicality is that a sequence x1, x2, . . . , xn that is PX -typical should, loosely speaking, have an empirical distribution that is in some sense close to the distribution PX . The two most common notions of typicality are that of strong (letter) typicality and weak (entropy) typicality. Whil...

The measure-theoretic definition of Kullback-Leibler relative-entropy (KL-entropy) plays a basic role in the definitions of classical information measures. Entropy, mutual information and conditional forms of entropy can be expressed in terms of KL-entropy and hence properties of their measure-theoretic analogs will follow from those of measure-theoretic KL-entropy. These measure-theoretic defi...

We consider a binary symmetric channel with additive binary interference known to the transmitter but unknown to the receiver. Depending on whether the interference signal is known noncausally or causally, this channel falls in the cases studied by Gel’fand and Pinsker and by Shannon, respectively, for which coding theorems and single-letter capacity expressions are known. In this work we prese...

In this work we show how source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-infotmation (Gel’fand-Pinsker problem) can be merged into a single joint source/channel scheme in the quadratic Gaussian case (where the channel is known as the dirty paper channel). This scheme achieves the optimal performance RWZ(D) = CDPC without using any information...

headings Abstract— In this paper we introduce and develop a framework for the data-hiding technologies that aim at resolving emerging problems of modern public networks. First, we emphasize the main open issues in public network security, quality of services control and secure communications. Secondly, we formulate digital data hiding as communications with side information and advocate an appr...

The correlation distance quantifies the statistical independence of two classical or quantum systems, via the distance from their joint state to the product of the marginal states. Tight lower bounds are given for the mutual information between pairs of two-valued classical variables and quantum qubits, in terms of the corresponding classical and quantum correlation distances. These bounds are ...

Habituation phenomena and decrements of neural responses in isolated nervous structures have been related to depression of synaptic potentials (Bruner & Kehoe, 1970; Kandel et al. 1970; Horn & Wright, 1970; Zucker, 1972). However, previous research (Stephens, 1973) has shown that repeated intracellular stimulation of neurones in the isolated abdominal ganglion of Aplysia caUfomica produces resp...