Universal redundancy rates do not exist

The expected redundancy per symbol of an n-block prefix code C/sub n/ on a source mu measures how far the code is from being optimal for that source. The existence of sequences of codes with expected redundancy per symbol of O((log n)/n) for 'nice' classes of sources, such as Markov sources of a given order, is well known. It is shown that some restriction on the class of processes is necessary in order to obtain such redundancy bounds, for there is no universal redundancy rate for any sequence of prefix codes on the class of all ergodic sources.<
>