Almost sure source coding theorems for general sources

For a source μ, which is assumed to be a probability measure on all strings of infinite length sequence with a finite alphabet, the notion of the almost-sure entropy rate is defined; it is an extension of the Shannon (1948) entropy rate. When both an encoder and a decoder know that a sequence is generated by μ, the optimal almost sure source coding rate is equal to the almost sure sup entropy rate