Page "Kraft's inequality" Paragraph 23
from
Wikipedia
Suppose that.
Let be the full-ary tree of depth.
Every word of length over an-ary alphabet corresponds to a node in this tree at depth.
The th word in the prefix code corresponds to a node ; let be the set of all leaf nodes in the subtree of rooted at.
Clearly
Page 1 of 1.
1.815 seconds.