I am just curious on a question about Hoffman Code. Huffman code for a probability distribution p is the prefix code with the minimum weighted average coded word length ∑piℓi, where ℓi is the length of the ith codword from the book. It works great on symbols where they have different probability distribution, by which I mean there exists high diversity in it. what if there is a upper bound on the largest probability distribution, or say all the probabilities are small? Is Huffman Code still the best?
No comments:
Post a Comment