Random coding strategies for minimum entropy
From MaRDI portal
Publication:4082684
DOI10.1109/TIT.1975.1055416zbMath0319.94012OpenAlexW2159998880MaRDI QIDQ4082684
Publication date: 1975
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1975.1055416
Probability measures on topological spaces (60B05) Information theory (general) (94A15) Axioms; other general questions in probability (60A05)
Related Items (13)
Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory ⋮ On the derivation of mean-field percolation critical exponents from the triangle condition ⋮ New bounds for the empirical robust Kullback-Leibler divergence problem ⋮ Grid entropy in last passage percolation -- a superadditive critical exponent approach ⋮ Generic stationary measures and actions ⋮ Neural network coding of natural images with applications to pure mathematics ⋮ A categorical characterization of relative entropy on standard Borel spaces ⋮ Statistical model and ML-EM algorithm for emission tomography with known movement ⋮ The ML–EM algorithm in continuum: sparse measure solutions ⋮ Nonequilibrium in thermodynamic formalism: the second law, gases and information geometry ⋮ Markov decision processes under ambiguity ⋮ Unnamed Item ⋮ Affine-mapping based variational ensemble Kalman filter
This page was built for publication: Random coding strategies for minimum entropy