Elements of information theory
Elements of information theory
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels
IEEE Transactions on Information Theory
Capacity bounds for power- and band-limited optical intensity channels corrupted by Gaussian noise
IEEE Transactions on Information Theory
Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs
IEEE Transactions on Information Theory
The fading number of single-input multiple-output fading channels with memory
IEEE Transactions on Information Theory
On the capacity of free-space optical intensity channels
IEEE Transactions on Information Theory
Sharp bounds on the entropy of the poisson law and related quantities
IEEE Transactions on Information Theory
Squeezing the Arimoto-Blahut algorithm for faster convergence
IEEE Transactions on Information Theory
| Hi-index | 755.02 |
The large-inputs asymptotic capacity of a peak-power and average-power limited discrete-time Poisson channel is derived using a new firm (nonasymptotic) lower bound and an asymptotic upper bound. The upper bound is based on the dual expression for channel capacity and the notion of capacity-achieving input distributions that escape to infinity. The lower bound is based on a lower bound on the entropy of a conditionally Poisson random variable in terms of the differential entropy of its conditional mean.