An algorithm for determining all the optimal input probability distributions of the DMC

DOI10.1109/TIT.1983.1056601MaRDI QIDQ3966044zbMATH OpenOpenAlexFDO

Authors Yoichiro Watanabe

Publication date 1983

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

Full work available at URL https://doi.org/10.1109/tit.1983.1056601

zbMATH Keywords

discrete memoryless channel (DMC)simplicial subchannels

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels
• scientific article; zbMATH DE number 763520
• On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels
• Approaching capacity of a continuous channel by discrete input distributions
• Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels

Cited in

(2)

• scientific article; zbMATH DE number 763520 (Why is no real title available?)
• An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels

This page was built for publication: An algorithm for determining all the optimal input probability distributions of the DMC

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