A universal variable-to-fixed length source code based on Lawrence's algorithm
T.J. Tjalkens, F.M.J. Willems · IEEE Transactions on Information Theory · 1992
It is shown that the modified Lawrence algorithm is universal over the class of binary memoryless sources and that the rate converges asymptotically optimally fast to the source entropy. It is proven that no codes exist that have a better asymptotic performance. The asymptotic bounds show that universal variable-to-fixed-length codes can have a significantly lower redundancy than universal fixed-to-variable-length codes with the same number of codewords.>