Sunday, May 2, 2010

Adaptive Huffman FGK Algorithm Musing

A short test of the FGK adaptive Huffman algorithm described in J.S. Vitter's paper reveals that the single pass compression algorithm described in the paper ( doesn't update the frequency value in the root of the tree. However, it's not that important because what we need from the tree is only the encoding for every leaf in the tree, i.e. the encoding for the symbols.

The study of various compression algorithm in my spare time mostly motivated by curiosity and the possible use of such a knowledge in future reverse engineering tasks.
Post a Comment

No comments: