An algorithm for computing the capacity of arbitrary discrete memoryless channels

Cited in

(44)

Extension of some results for channel capacity using a generalized information measure
An iterative method for computing the performance of discrete memoryless communication channels
Descent methods for convex essentially smooth minimization
On the convergence of the coordinate descent method for convex differentiable minimization
Capacity of random channels with large alphabets
Pursuit of food \textit{versus} pursuit of information in a Markovian perception-action loop model of foraging
Shannon optimal priors on independent identically distributed statistical experiments converge weakly to Jeffrey's prior
Geometry of Arimoto algorithm
A scaling law from discrete to continuous solutions of channel capacity problems in the low-noise limit
Asymptotics of input-constrained binary symmetric channel capacity
Metabolically efficient information processing
Information optimality and Bayesian modelling
Bayesian testing of a point null hypothesis based on the latent information prior
Neural network coding of natural images with applications to pure mathematics
Au Algorithm for Calculating the Generalized γ-Capacity
Systems of Bounded Rational Agents with Information-Theoretic Constraints
Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
scientific article; zbMATH DE number 3941418 (Why is no real title available?)
Computation of channel capacity based on self-concordant functions
Energy-Efficient Coding with Discrete Stochastic Events
Conjugate Priors Represent Strong Pre-Experimental Assumptions
Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection
A minimally informative likelihood for decision analysis: Illustration and robustness
Capacity of optical wireless communication channels
Statistical problem classes and their links to information theory
Optimal causal inference: estimating stored information and approximating causal architecture
A reward-maximizing spiking neuron as a bounded rational decision maker
Quantifying information transmission in eukaryotic gradient sensing and chemotactic response
Geometry of EM and related iterative algorithms
Convergence rate analysis of the multiplicative gradient method for PET-type problems
An Introduction to Neural Data Compression
Dynamic discrete choice under rational inattention
Markov capacity for factor codes with an unambiguous symbol
Reverse EM-problem based on Bregman divergence and its application to classical and quantum information theory
On a proof of the convergence speed of quadratic recurrence formulas in the Arimoto-Blahut algorithm
Provably efficient information-directed sampling algorithms for multi-agent reinforcement learning
Notes on conditional entropy and commitment capacity
A constrained BA algorithm for rate-distortion and distortion-rate functions
On effective convergence in Fekete's lemma and related combinatorial problems in information theory
Codes for adversaries: between worst-case and average-case jamming
Bregman proximal gradient method for linear optimization under entropic constraints
Iterative minimization algorithm on a mixture family
On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels
Cooperation in self-organizing map networks enhances information transmission in the presence of input background activity

This page was built for publication: An algorithm for computing the capacity of arbitrary discrete memoryless channels

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