In some channels subject to crosstalk or other types of additive interference, the noise is the sum of a dominant Gaussian noise and a relatively weak non-Gaussian contaminating noise. Although the capacity of such channels cannot be evaluated in general, we analyze the decrease in capacity, or sensitivity of the channel capacity to the weak contaminating noise. The main result of this paper is...

In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a constant gap regardless of channel parameters. These results are based on a layered modulo-lattice scheme which realizes distributed interference cancell...

The mutual information of a discrete time memoryless Rayleigh fading channel is considered, where neither the transmitter nor the receiver has the knowledge of the channel state information except the fading statistics. We present the mutual information of this channel in closed form when the input distribution is complex Gaussian, and derive a lower bound in terms of the capacity of the corres...

In this paper, we study, information theoretically, the impact of transmitter and or receiver cognition on the channel capacity. The cognition can be described by state information, dependent on the channel noise and or input. Specifically, as a new idea, we consider the receiver cognition as a state information dependent on the noise and we derive a capacity theorem based on the Gaussian versi...

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel ...

Determining the capacity of Gaussian relay channels even with one relaying station has been an open problem for several decades. This paper presents a pair of upper and lower bounds whose gap is no more than 0.5 bit per channel use, for the capacity of Gaussian relay channels with one relaying station.

Abstract: In this paper we derive closed-form expressions for the single-user capacity of selection combining diversity (SCD) system, taking into account the effect of imperfect channel estimation at the receiver. The channel considered is a slowly varying spatially independent flat Rayleigh fading channel. The complex channel estimate and the actual channel are modelled as jointly Gaussian ran...

We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency d...

The heat channel is defined by an analog filter and a subsequent measurement of the filter output signal perturbed by additive white Gaussian noise. The filter is related to the heat kernel of the quantum mechanical harmonic oscillator, so the name of the channel. The channel is modeled as an infinite-dimensional vector Gaussian channel and the capacity in terms of average energy of the input s...

It is well known that queues with exponentially distributed service time have the smallest Shannon capacity among all single-server queues with the same service rate. However, the capacity of other service disiplines such as Gaussian service timing channels (GSTC) remains unknown. In this paper, we outline a preliminary investigation into timing channel capacity, when the service distributions ...