On the discreteness of capacity-achieving distributions

Authors:
A. Tchamkerten
Affiliations:
Lab. de Theorie de l'Inf., Ecole Polytech. Fed. de Lausanne, Switzerland
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Capacity of a single spiking neuron channel

Neural Computation
Transition points in the capacity-achieving distribution for the peak-power limited AWGN and free-space optical intensity channels

Problems of Information Transmission
Channel capacity bounds in the presence of quantized channel state information

EURASIP Journal on Wireless Communications and Networking

Quantified Score

Hi-index	754.84

Visualization

Abstract

We consider a scalar additive channel x → x + N whose input is amplitude constrained. By extending Smith's (1969) argument, we derive a sufficient condition on noise probability density functions (pdf) that guarantee finite support for the associated capacity-achieving distribution(s).