Related papers: On the Cooperative Communication over Cognitive In…
One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…
We exhibit discrete memoryless quantum channels whose quantum capacity assisted by two-way classical communication, $Q_2$, exceeds their unassisted one-shot Holevo capacity $C_H$. These channels may be thought of as having a data input and…
In this work we study the capacity of interference-limited channels with memory. These channels model non-orthogonal communications scenarios, such as the non-orthogonal multiple access (NOMA) scenario and underlay cognitive communications,…
Interactive communication (IC), i.e., the reciprocal exchange of information between two or more interactive partners, is a fundamental part of human nature. As such, it has been studied across multiple scientific disciplines with different…
The capacity regions of semideterministic multiuser channels, such as the semideterministic relay channel and the multiple access channel with partially cribbing encoders, have been characterized using the idea of partial-decode-forward.…
In this paper we will describe all necessary parts of Brain-Computer Interface (BCI), such as source of signals, hardware, software, analysis, architectures of complete system. We also will go along various applications of BCI, view some…
The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…
We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The…
This work investigates the general two-user Compound Broadcast Channel (BC) where an encoder wishes to transmit common and private messages to two receivers while being oblivious to two possible channel realizations controlling the…
Information-theoretic limits of {\it cognitive radio} networks have been under exploration for more than a decade. Although such limits are unknown for many networks, including the simplest case with two pairs of transmitter-receiver, there…
Any physical channel of communication offers two potential reasons why its capacity (the number of bits it can transmit in a unit of time) might be unbounded: (1) Infinitely many choices of signal strength at any given instant of time, and…
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful…
The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…
A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial…
In this work, we study two problems: three-user Multiple-Access Channel (MAC) with correlated sources, and MAC with Feedback (MAC-FB) with independent messages. For the first problem, we identify a structure in the joint probability…
Entanglement-assisted communication over a random-parameter quantum channel with either causal or non-causal channel side information (CSI) at the encoder is considered. This describes a scenario where the quantum channel depends on the…
In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…
Distributed computing frameworks such as MapReduce and Spark are often used to process large-scale data computing jobs. In wireless scenarios, exchanging data among distributed nodes would seriously suffer from the communication bottleneck…
The integrated sensing and communication (ISAC) problem with general state and channel distributions is investigated. General formulas of the capacity-distortion tradeoff for the ISAC problem under maximal and average distortion constraints…
The K-user discrete memoryless (DM) broadcast channel (BC) with two nested multicast messages is studied in which one common message is to be multicast to all receivers and the second private message to a subset of receivers. The receivers…