On tries, suffix trees, and universal variable-length-to-block codes

We show how a digital tree (or trie) structure can be used for both parsing and encoding (in a variable-length to block (VB) or variable-length to variable-length (VV) fashion) of sequences of symbols from a stochastic source. As an example, we construct a simple VB code based on a fixed database adaptation model, and derive an asymptotic expression for its average redundancy rate for memoryless sources.