A Generalization of Ornstein's $\bar d$ Distance with Applications to Information Theory
A Generalization of Ornstein's $\bar d$ Distance with Applications to Information Theory
Ornstein's $\bar{d}$ distance between finite alphabet discrete-time random processes is generalized in a natural way to discrete-time random processes having separable metric spaces for alphabets. As an application, several new results are obtained on the information theoretic problem of source coding with a fidelity criterion (information transmission at rates below …