An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels
DOI10.1109/TIT.2007.915703zbMATH Open1311.94055MaRDI QIDQ3604431FDOQ3604431
Authors: Xue-Bin Liang 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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
Statistical aspects of information-theoretic topics (62B10) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)
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)
