Encoding of Information Generated by UnknownSource without Memory with Infinite Alphabet

摘要

The problem of encoding of a source with an infinite, countable alphabet arises, for example, when compressing a sequence obtained by quantizing the results of orthogonal transformations of a random process. Encoding of positive integers is also used in Ziv-Lempel codes.