Related papers: Capacity of Block-Memoryless Channels with Causal …
The capacity of the semi-deterministic relay channel (SD-RC) with non-causal channel state information (CSI) only at the encoder and decoder is characterized. The capacity is achieved by a scheme based on cooperative-bin-forward. This…
This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…
A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…
In this paper, the Two-Way Channel (TWC) with Cannel State Information (CSI) is investigated. First, an achievable rate region is derived for the discrete memoryless channel. Then by extending the result to the Gaussian TWC with additive…
The memoryless noncoherent single-input single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions for the mutual information between the output and the input of this channel when the input magnitude distribution is…
The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting where a message-cognizant rate-limited helper observes the state sequence noncausally, produces its description, and provides the description…
The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The…
In this paper, we study a model of communication under adversarial noise. In this model, the adversary makes online decisions on whether to corrupt a transmitted bit based on only the value of that bit. Like the usual binary symmetric…
Capacity analysis for channels with side information at the receiver has been an active area of interest. This problem is well investigated for the case of finite alphabet channels. However, the results are not easily generalizable to the…
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…
We consider the bosonic compound wiretap channel. A pair of lossy channels connects a sender with both a (legitimate) receiver and an eavesdropper. The sender and receiver have only partial information about the actual state of the…
The non-signaling (NS) assisted capacity of a classical channel with causal channel state information at the transmitter (CSIT) is shown to be $C^{NS,ca}=\max_{P_{X|S}}I(X;Y\mid S)$, where $X, Y, S$ correspond to the input, output and state…
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…
The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete…
In this paper, the capacity of continuous-space electromagnetic channels, where transceivers are confined in given lossy regions, is analyzed. First of all, the regions confining the transceivers are assumed to be filled with dielectric,…
We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…
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…
The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Outer and inner bounds on the capacity region are derived when the…
In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios in which…
We calculate the information capacities of a time-correlated amplitude-damping channel, provided the sender and receiver share prior entanglement. Our analytical results show that the noisy channel with zero capacity can transmit…