An algorithm for computing the capacity of arbitrary discrete memoryless channels
From MaRDI portal
Publication:5635341
DOI10.1109/TIT.1972.1054753zbMath0227.94011OpenAlexW2029236670MaRDI QIDQ5635341
Publication date: 1972
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1972.1054753
Related Items
Information optimality and Bayesian modelling, Bayesian testing of a point null hypothesis based on the latent information prior, Energy-Efficient Coding with Discrete Stochastic Events, Extension of some results for channel capacity using a generalized information measure, Asymptotics of input-constrained binary symmetric channel capacity, Statistical Problem Classes and Their Links to Information Theory, Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection, Capacity of random channels with large alphabets, Computation of channel capacity based on self-concordant functions, 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, On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels, Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor, Neural network coding of natural images with applications to pure mathematics, A Reward-Maximizing Spiking Neuron as a Bounded Rational Decision Maker, Shannon optimal priors on independent identically distributed statistical experiments converge weakly to Jeffrey's prior, Geometry of Arimoto algorithm, Cooperation in self-organizing map networks enhances information transmission in the presence of input background activity, An iterative method for computing the performance of discrete memoryless communication channels, Metabolically Efficient Information Processing, Quantifying information transmission in eukaryotic gradient sensing and chemotactic response, Au Algorithm for Calculating the Generalized γ-Capacity, Conjugate Priors Represent Strong Pre-Experimental Assumptions, Unnamed Item, A minimally informative likelihood for decision analysis: Illustration and robustness, Pursuit of food \textit{versus} pursuit of information in a Markovian perception-action loop model of foraging, Systems of Bounded Rational Agents with Information-Theoretic Constraints, A scaling law from discrete to continuous solutions of channel capacity problems in the low-noise limit, Capacity of optical wireless communication channels, Optimal causal inference: Estimating stored information and approximating causal architecture, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization
