A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
2007 Australasian Telecommunication Networks and Applications Conference
A word-valued source Y is any discrete finite alphabet random process that is created by encoding a discrete random process X with a symbol-to-word function f . The first result of this paper solves an open problem by proving an existence theorem for the entropy rate of word valued sources: If X is ergodic, then the entropy rate of the word valued source Y exists, and it is upper bound by the entropy rate of X divided by the expected codeword length. More generally, if X is Asymptotically Meandoi:10.1109/atnac.2007.4665292 fatcat:xt4ooow6aja3tpzmgl2vuj6454