Enumerative implementation of Lempel-Ziv 77 algorithm

For each l = 1, 2, 3, ... recursively, we define w_l to be the unique prefix of x_l ^infin, which is in the external leaf set of the trie {lambda, w₁, w₂, ..., w_l-1}, for a given data x_l ^infin. This definition gives the Lempel-Ziv 77 parsing and associated data compression algorithm. We give a simple implementation which utilizes an enumerative code. Furthermore, we introduce and apply a simple post-processing mechanism which matches to this code.