Huffman and Shannon–Fano Codes
0/66 solved1 / 66
Each question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.
Huffman's algorithm merges nodes until one remains. For an alphabet of 4 symbols, how many merge steps does it perform?
Your answer
info-huffman-9All Information Theory chapters