Universal data compression and repetition times
F.M.J. Willems · IEEE Transactions on Information Theory · 1989
A novel universal data compression algorithm is described. This algorithm encodes L source symbols at a time. An upper limit for the number of bits per source symbol is given for the class of binary stationary sources. In the author's analysis, a property of repetition times turns out to be of crucial importance.>