Enumerative implementation of Lempel-Ziv 77 algorithm

For each l = 1, 2, 3, … recursively, we define wl to be the unique prefix of xl^∞, which is in the external leaf set of the trie {λ, w1, w2, …, wl−1}, for a given data xl^∞. 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.