Using Tries for Universal Data Compression
Yuriy A. Reznik, Anatoly V. Anisimov · Birkhäuser Basel eBooks · 2004
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 . These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.