$\varepsilon$-Entropy of Discrete Information Sources

This article is concerned with the problem of obtaining explicit expressions for the $\varepsilon$-entropy of segments of random processes with a finite number of states and discrete time. The corresponding calculations show that these expressions are awkward and obscure and take on a sufficiently simple form only for “small” values of $\varepsilon$. Because of this, attention is chiefly concentrated on obtaining simple and convenient bounds.