zbMATH — the first resource for mathematics

A note on McMillan’s theorem for countable alphabets. (English) Zbl 0199.21401
Trans. 3rd Prague Conf. Information theory, statistical decision functions, random processes, Liblice, 1962, 541-543 (1964).
From the introduction: The purpose of this note is to give a simple proof of the famous McMillan’s theorem for the case of countable alphabets.

94A15 Information theory (general)