Linked from

The 12 pages that link to Huffman coding, each with the reason it gives.

• JPEGRelated: JPEG commonly entropy-codes quantized coefficients with Huffman tables.

• Image compressionRelated: It is one method codecs can use to encode symbol frequencies compactly.

• MP3Related: MP3 applies it to quantized spectral values to reduce the encoded stream.

• Binary treeRelated: Its codewords are represented by paths through a binary tree.

• Priority queueRelated: A priority queue efficiently selects the two lowest-frequency nodes at each merge.

• Kraft–McMillan inequalityRelated: Its resulting code lengths form a prefix code and obey the inequality.