On the Discreteness of Capacity-Achieving Distributions

DOI10.1109/TIT.2004.836662MaRDI QIDQ3547701zbMATHFDO

Authors Aslan Tchamkerten

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

Additive channelcapacity-achieving distribution

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Approaching capacity of a continuous channel by discrete input distributions
• The information capacity of amplitude- and variance-constrained sclar gaussian channels
• The capacity of discrete-time memoryless Rayleigh-fading channels
• An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels
• Coding capacity for a class of additive channels

Cited in

(6)

• On the Expected Capacity of Binomial and Random Concentrators
• Transition points in the capacity-achieving distribution for the peak-power limited AWGN and free-space optical intensity channels
• Capacity of a Single Spiking Neuron Channel
• On the Capacity-Achieving Distribution of the Discrete-Time Noncoherent and Partially Coherent AWGN Channels
• A scaling law from discrete to continuous solutions of channel capacity problems in the low-noise limit
• Metabolic cost of neuronal information in an empirical stimulus-response model

This page was built for publication: On the Discreteness of Capacity-Achieving Distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547701)