ConceptMathematics
Huffman's algorithm
A greedy algorithm for constructing optimal prefix-free codes by iteratively combining the two lowest-probability symbols.
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.