Answers are grounded in this paper and cite their sources.
For a class of ergodic sources a given finite alphabet satisfying certain conditions, a formula is given for the minimum rate above which strong universal fixed-rate and variable-rate block coding of respect to an arbitrary single-letter fidelity criterion can be done. The result extends several previous strong universal block coding theorems. As an application it is shown that there is a metric on the class of stationary sources weaker thand̄-metric for which compactness of the metric implies that strong universal coding can be done at all rates.
No takes yet. Share an insight, caveat, or question.
John C. Kieffer (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: