What is the generalization of Huffman coding trees for situations, where the resulting alphabet is not binary? For example, if I want to shorten some text by typing it into Ternary, then I can also create a prefix-free coding system as a writing for each character I. Will the direct simplification of Huffman construction (using the Kashmir tree instead of a binary tree) still work correctly and efficiently? Or does this construction bring about the highly disabled academy plan?
Algorithm still works and it is still simple ???? In fact, there is a brief reference to Wikipedia's original Huffman paper citing as a source.
This has happened to me, however, as Huffman is a little less because it allocates an integer number of bits for each symbol (as opposed to example), triangle Huffman at least The more should be sub-totals because it assigns an integer number of trits is not particularly a show-stop for 3, but it indicates that N-ary huffman further behind other coding algorithms As you increase n
Comments
Post a Comment