ConceptMathematics
Structural lemmas for Huffman codes
Lemmas proving that the two lowest-probability symbols in an optimal tree must have the longest encodings and be siblings.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Expected encoding length1Prefix-free code1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.