A source matching approach to finding minimax codes

DOI10.1109/TIT.1980.1056167zbMath0431.94026OpenAlexW2148574462MaRDI QIDQ3869236

Alberto Leon-Garcia, Lee D. Davisson

Publication date: 1980

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1980.1056167

zbMATH Keywords

channel capacity problemBernoulli-like sourceextensions of finite alphabet memoryless sourcesLynch-Davisson codeminimax codes for classes of memoryless sourcesmonotonic sourcessource matching

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (10)

Jeffreys' prior is asymptotically least favorable under entropy risk ⋮ Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory ⋮ Consistent estimation of the number of regimes in Markov-switching autoregressive models ⋮ Mutual information, metric entropy and cumulative relative entropy risk ⋮ Inference after checking multiple Bayesian models for data conflict and applications to mitigating the influence of rejected priors ⋮ On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels ⋮ Game-theoretic probability combination with applications to resolving conflicts between statistical methods ⋮ Bayesian predictive densities based on latent information priors ⋮ Information-theoretic determination of minimax rates of convergence ⋮ Universal retrieval trees

This page was built for publication: A source matching approach to finding minimax codes