Related papers: The Channel Capacity Increases with Power

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…

Classical communication capacity of a channel can be enhanced either through a device called a 'quantum switch' or by putting the channel in a quantum superposition. The gains in the two cases, although different, have their origin in the…

Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…

We investigate if feedback can increase the capacity of an energy harvesting communication channel where a transmitter powered by an exogenous energy arrival process and equipped with a finite battery communicates to a receiver over a…

We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown channel law and continuous output alphabet. A novel data-driven algorithm is proposed that exploits the dual representation of…

We study a class of finite-state channels, known as POST channels, in which the previous channel output serves as the current state. A POST channel is deemed approximately memoryless when the state-dependent transition matrices are…

Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the…

We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches, and a convex combination of depolarizing channels. We prove that the capacity is additive in both cases. As a…

The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation---or, more generally, the $\rho$-th moment---of the number of messages that could have produced the output of the channel…

The capacity of discrete-time, noncoherent, multipath fading channels is considered. It is shown that if the variances of the path gains decay faster than exponentially, then capacity is unbounded in the transmit power.

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the achievable capacity in transmission of information from one…

A discrete compound channel with memory is considered, where no stationarity, ergodicity or information stability is required, and where the uncertainty set can be arbitrary. When the discrete noise is additive but otherwise arbitrary and…

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…

We consider a generalization of the discrete memoryless channel, in which the channel probability distribution is replaced by a uniform distribution over clouds of channel output sequences. For a random ensemble of such channels, we derive…

We consider finite state channels where the state of the channel is its previous output. We refer to these as POST (Previous Output is the STate) channels. We first focus on POST($\alpha$) channels. These channels have binary inputs and…

Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector…

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…

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…

Recent works show conflicting results: network capacity may increase or decrease with higher transmission power under different scenarios. In this work, we want to understand this paradox. Specifically, we address the following questions:…