Define a standardized set of Huffman-coding trees for alphabets with a distribution following Zipf's law. This should be easy. The first character in the alphabet has the highest frequency, and so forth. To use the tree, the user needs to specify a permutation to put the letters in order ranked by frequency. Probably parameterize the Huffman tree by the size of the alphabet.
No comments :
Post a Comment