Concentration and superconcentration operations play a central role in the constructions of nonblocking switching networks. This was established in a seminal effort by Bassalygo and Pinsker who showed that an n-input nonblocking switching network can be constructed with O(n log n) crosspoints if concentrators can be constructed with O(n) crosspoints. Starting with the pioneering work of Marguli...

The classic Costa’s “writing on dirty paper” capacity result establishes that full state pre-cancellation can be attained in the Gel’fand-Pinsker channel with additive state and additive Gaussian noise. This result holds under the assumption that perfect channel knowledge is available at both transmitter and receiver: such an assumption is not valid in wireless scenarios affected by fading and ...

Every clone of functions comes naturally equipped with a topology—the topology of pointwise convergence. A clone C is said to have automatic homeomorphicity with respect to a class C of clones, if every clone-isomorphism of C to a member of C is already a homeomorphism (with respect to the topology of pointwise convergence). In this paper we study automatic homeomorphicity-properties for polymo...

We generalize the Gel’fand-Pinsker model with the setup of a memoryless multiple-access channel where there is a single message source fed to both encoders. Only one of the encoders knows the state of the channel (non-causally), which is also unknown to the receiver. We find an explicit characterization of the capacity of this single-user channel. An explicit characterization of the capacity is...

In this paper, we consider the problem of pure information transmission and channel state estimation via state dependent channels. We show that the knowledge of auxiliary random variable, used in the codebook construction of random binning techniques, is sufficient to perform the optimal channel state estimation. We compare the obtained results with optimal rate-distortion region obtained using...

Three results dealing with probability distributions (p, q) over a two-element set are presented. The first two give bounds for the entropy function H(p, q) and are referred to as the logarithmic and the power-type bounds, respectively. The last result is a refinement of well known Pinsker-type inequalities for information divergence. The refinement readily extends to general distributions, but...

The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel’s zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may require more than one channel use. These phenomena do not occur when the state is revealed to the transmitter causally, a case that is solved here using Shannon s...

We develop a fine-scale local analysis of measure entropy and measure sequence entropy based on combinatorial independence. The concepts of measure IE-tuples and measure IN-tuples are introduced and studied in analogy with their counterparts in topological dynamics. Local characterizations of the Pinsker von Neumann algebra and its sequence entropy analogue are given in terms of combinatorial i...

Inequalities which connect information divergence with other measures of discrimination or distance between probability distributions are used in information theory and its applications to mathematical statistics, ergodic theory and other scientific fields. We suggest new inequalities of this type, often based on underlying identities. As a consequence we obtain certain improvements of the well...

In the above-mentioned article, the supplementary data had the incorrect figure listed for Supplementary Fig. 3. The correct figure is presented below. The online version has been corrected to reflect this change. Gregory P. Forlenza, Sunil Deshpande, Trang T. Ly, Daniel P. Howsmon, Faye Cameron, Nihat Baysal, Eric Mauritzen, Tatiana Marcal, Lindsey Towers, B. Wayne Bequette, Lauren M. Huyett, ...