Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Some optimal prefix tree places the two least probable symbols as sibling leaves of maximum depth, which is the inductive basis of Huffman's algorithm.

Ancestors (6)

  1. Huffman coding
  2. Information theory
  3. Probability and statistics
  4. Area of mathematics
  5. Mathematics
  6. Home