How to encode a stationary source

We study the problem of constructing messages of the form /spl omega//sub 1/, /spl omega//sub 2/, ..., where each /spl omega//sub k/ is a letter from a finite alphabet, so that the statistics of /spl omega//sub 1/, /spl omega//sub 2/, ... correspond to a given stationary probability distribution.