Asymptotical optimality of two variations of Lempel-Ziv codes for sources with countably infinite alphabet

This paper considers the problem of universally coding stationary ergodic sources with countably infinite alphabet. Especially, we show a sufficient condition for both of Lempel-Ziv '78 and '77 (LZ78 and LZ77) coding algorithms to achieve asymptotically the entropy rate of those sources.