An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels
From MaRDI portal
Publication:3604431
Recommendations
- An algorithm for determining all the optimal input probability distributions of the DMC
- On calculating the capacity of an infinite-input finite (infinite)-output channel
- On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels
- Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels
- Approaching capacity of a continuous channel by discrete input distributions
Cited in
(8)- Spectrum invariancy under output approximation for full-rank discrete memoryless channels
- On the method of types and approximation of output measures for channels with infinite alphabets
- Computation of channel capacity based on self-concordant functions
- On calculating the capacity of an infinite-input finite (infinite)-output channel
- On the Discreteness of Capacity-Achieving Distributions
- On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels
- An algorithm for determining all the optimal input probability distributions of the DMC
- A Deterministic Algorithm for the Capacity of Finite-State Channels
This page was built for publication: An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604431)
