Title :
On tries, suffix trees, and universal variable-length-to-block codes
Author :
Reznik, Yuriy A.
Author_Institution :
RealNetworks, Inc., Seattle, WA, USA
Abstract :
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.
Keywords :
block codes; memoryless systems; redundancy; source coding; tree data structures; trees (mathematics); variable length codes; average redundancy rate; digital tree structure; encoding; fixed database adaptation model; memoryless sources; parsing; stochastic source; suffix trees; tries; universal variable-length-to-block codes; Adaptation model; Databases; Decoding; Electronic mail; Entropy; Hydrogen; Stochastic processes;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023395
