Linked from

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

• Information theoryBroader topic: It turns source probabilities into efficient variable-length representations.

• Data compressionBroader topic: It reduces average code length when symbol frequencies are uneven.

• Lossless compressionBroader topic: It is a classic entropy-coding method used in formats such as DEFLATE.

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

• Greedy algorithmBroader topic: Repeatedly merging the smallest frequencies yields an optimal prefix code.

• 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.

• Shannon's source coding theoremBroader topic: It illustrates finite-block coding and can remain above the entropy limit.

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

• Information and communication theoryBroader topic: It is a practical variable-length code grounded in source probabilities.