ConceptMathematics
Huffman code expected length bound
The theorem stating that the expected length L of a Huffman code satisfies H <= L <= H + 1.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.