We study blind fingerprinting, where the host sequence into which fingerprints are embedded is partially or completely unknown to the decoder. This problem relates to a multiuser version of the Gel’fand-Pinsker problem. The number of colluders and the collusion channel are unknown, and the colluders and the fingerprint embedder are subject to distortion constraints. We propose a conditionally c...

The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity results for certain classes of channels have been proved. In this paper we present new inner and outer bounds for the capacity region of the cognitive interference...

AbsfructThe performance of a multiprocessor system depends heavily on its ability to provide conflict free paths among its processors. In this paper, we explore the possibility of using a nonblocking network with O ( N log N ) edges (crosspoints) to interconnect the processors of an N processor system. We combine Bassalygo and Pinsker's implicit design of strictly nonblocking networks with an e...

It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy function) with high probability is a (ρ, 1/ε)-list decodable code. (That is, every Hamming ball of radius at most ρn has at most 1/ε codewords in it.) In this paper we prove the “converse” result. In particular, we prove that for every 0 ...

The classical Shannon-McMillan's fundamental limit theorem concerns the asymptotic behaviour of the probability of n-letter blocks produced by a discrete stationary source. In the case of abstract-alphabet sources we replace naturally the above probability by some probability density. Instead of individual sources we, thus, need now pairs of sources, the one dominating (in the sense of absolute...

The giant neurones and relatively long nerves or connectives of the mollusca have been used extensively in electrophysiological studies, but little work has been done on the physiological behaviour of neurones in situ. Hughes & Tauc (1962) have reported investigation on giant cells of Aplysia in the whole animal as well as in isolated ganglion preparations. Recently, the gill-withdrawal reflex ...

We consider a full-duplex state-dependent relay channel with state non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals can be equipped with cognition capabilities, i.e, the relay in our model. In the discrete memoryless (DM) case, we obtain inner and outer bounds on the capacity. The inner bound is obtained by a coding scheme at t...

We consider embedding of messages (data-hiding) into i.i.d. host sequences. As in Fridrich et al. [2002] we focus on the case where reconstruction of the host sequence from the composite sequence is required. We study the balance between embedding rate and embedding distortion. First we determine the distortion-rate region corresponding to this setup. Then we generalize this result in two direc...

We consider a state-dependent full-duplex relay channel with the channel states available non-causally at only the source, i.e., neither at the relay nor at the destination. For the discrete memoryless (DM) case, we establish lower and upper bounds on the channel capacity. The lower bound is obtained by a coding scheme at the source that uses a Gel’fand-Pinsker like binning scheme at the source...

In this paper, we propose a new theoretical framework for the data-hiding problem of digital and printed text documents. We explain how this problem can be seen as an instance of the well-known Gel’fand-Pinsker problem. The main idea for this interpretation is to consider a text character as a data structure consisting of multiple quantifiable features such as shape, position, orientation, size...