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