ConceptAI & ML
Huffman coding
An entropy encoding algorithm that uses shorter bit strings for more common inputs and longer bit strings for less common inputs.
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.
Binary tree1Data compression1Expected code length1Lossless compression1Prefix-free code1Run-length encoding1Weight distribution1
Lecturers
3Each in their own terms, from the easiest level.
Ankur Moitra
A greedy algorithm that generates an optimal prefix-free code by repeatedly merging the two symbols with the smallest probabilities.Song Han
Assigning variable-length bit codes based on frequency, using more bits for infrequent weights and fewer bits for frequent weights.
Connections
7The lectures that define it or assume it, and the concepts next to it.