Related papers: Identification over Compound Multiple-Input Multip…
The Interference Channels (ICs) represent fundamental building blocks of wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two…
Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel…
This paper presents two new results on multiple-input multiple-output (MIMO) Gaussian broadcast channels with confidential messages. First, the problem of the MIMO Gaussian wiretap channel is revisited. A matrix characterization of the…
Optical wireless communication (OWC) using intensity-modulation and direct-detection (IM/DD) has a channel model which possesses unique features, due to the constraints imposed on the channel input. The aim of this tutorial is to overview…
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…
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…
Motivated by results in optical communications, where the performance can degrade dramatically if the transmit power is sufficiently increased, the channel capacity is characterized for various kinds of memoryless vector channels. It is…
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…
Various applications of molecular communications (MC) are event-triggered, and, as a consequence, the prevalent Shannon capacity may not be the right measure for performance assessment. Thus, in this paper, we motivate and establish the…
Given a general channel, we first formulate the idetification capacity problem as well as the resolvability problem with input cost constraint in as the general form as possible, along with relevant fundamental theorems. Next, we establish…
We study communication with consensus over a broadcast channel - the receivers reliably decode the sender's message when the sender is honest, and their decoder outputs agree even if the sender acts maliciously. We characterize the…
Jolfaei et al. used feedback to create transmit signals that are simultaneously useful for multiple users in a broadcast channel. Later, Georgiadis and Tassiulas studied erasure broadcast channels with feedback, and presented the capacity…
The traditional notion of capacity studied in the context of memoryless network communication builds on the concept of block-codes and requires that, for sufficiently large blocklength n, all receiver nodes simultaneously decode their…
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by…
We study the capacity region of two-user erasure interference channels with local delayed channel state information at the transmitters. In our model, transmitters have local mismatched outdated knowledge of the channel gains. We propose a…
In this paper, we study the multiple-antenna wireless communication networks, where a large number of devices simultaneously communicate with an access point. The capacity region of multiple-input multiple-output massive multiple access…
Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…
Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…
Ahlswede and Dueck showed possibility to identify with high probability one out of $M$ messages by transmitting $1/C\log\log M$ bits only, where $C$ is the channel capacity. It is known that this identification can be based on…
We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical…