相关论文: Capacity of Gaussian Arbitrarily-Varying Fading Ch…

We consider a state-dependent parallel Gaussian channel with independent states and a common cognitive helper, in which two transmitters wish to send independent information to their corresponding receivers over two parallel subchannels.…

The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of…

The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the…

Channel modeling is a critical topic when considering designing, learning, or evaluating the performance of any communications system. Most prior work in designing or learning new modulation schemes has focused on using highly simplified…

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as many-user information…

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one…

We introduce the two-way Gaussian interference channel in which there are four nodes with four independent messages: two-messages to be transmitted over a Gaussian interference channel in the $\rightarrow$ direction, simultaneously with…

We consider a complex Gaussian wiretap channel with finite-resolution analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. For this channel, we show that a positive secrecy rate is always achievable as…

This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

This paper develops a new communication strategy, ergodic interference alignment, for the K-user interference channel with time-varying fading. At any particular time, each receiver will see a superposition of the transmitted signals plus…

The impact of phase fading on the classical Costa dirty paper coding channel is studied. We consider a variation of this channel model in which the amplitude of the interference sequence is known at the transmitter while its phase is known…

We study the problem of communication over a discrete arbitrarily varying channel (AVC) when a noisy version of the state is known non-causally at the encoder. The state is chosen by an adversary which knows the coding scheme. A…

The growing need for reliable communication over untrusted networks has caused a renewed interest in adversarial channel models, which often behave much differently than traditional stochastic channel models. Of particular practical use is…

We consider a line with noise in the simplest case. Loss does not add noise. Amplification via phase insensitive amplifiers do add noise. A lower bound of this capacity is the quantum analog to the Shannon capacity of a linear channel with…

The pure-loss channel is a fundamental model for describing noise in bosonic quantum platforms. It is characterised by a single parameter, the transmissivity, which quantifies the fraction of the input energy that reaches the output of the…

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

A classical result in Information Theory states that the Gaussian noise is the worst-case additive noise in point-to-point channels, meaning that, for a fixed noise variance, the Gaussian noise minimizes the capacity of an additive noise…

In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x=(x_1,...,x_n)…

In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert…