Variable-to-fixed length codes for predictable sources

A number of papers have investigated the compression obtained by some well-known lossless data compression algorithms in the limit as the dictionary size approaches infinity. Using a very detailed analysis of the Tunstall (1967) code as an example, we demonstrate that asymptotic analyses can fail to provide the performance of an algorithm in the important case of a predictable source with a small to moderate dictionary size.