A source matching approach to finding minimax codes
From MaRDI portal
Recommendations
Cited in
(14)- Universal retrieval trees
- Jeffreys' prior is asymptotically least favorable under entropy risk
- Mutual information, metric entropy and cumulative relative entropy risk
- Information-theoretic determination of minimax rates of convergence
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
- Theorem with applications in coding and matching problems
- Source matching problems revisited
- A minimax method with application to the initial vector coding problem*
- Game-theoretic probability combination with applications to resolving conflicts between statistical methods
- On the source matching approach for Markov sources (Corresp.)
- Consistent estimation of the number of regimes in Markov-switching autoregressive models
- Bayesian predictive densities based on latent information priors
- 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
This page was built for publication: A source matching approach to finding minimax codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869236)