On the minimum rate for strong universal block coding of a class of ergodic sources
John C. Kieffer · IEEE Transactions on Information Theory · 1980
For a class of ergodic sources\Lambdaon 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\Lambdawith 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 than\bar{d}-metric for which compactness of\Lambdain the metric implies that strong universal coding can be done at all rates.