Compute the Huffman tree for a Zipf distribution of various sizes. Zipf seems to happen often naturally in the world with regards to information. Particularly useful might be for 256 elements, representing bytes. Because the Zipf distribution is fixed (e.g., for exponent 1), this needs only to be computed once. To use it, specify the permutation.
For exponents greater than 1, the infinite tree could be precomputed. Arithmetic coding might be easier.
No comments :
Post a Comment