Huffman encoding
nounUK /ˈhʌfmən ɪnˈkəʊdɪŋ/
US /ˈhʌfmən ɪnˈkoʊdɪŋ/
A way to make files smaller by giving the most common letters the shortest codes.
The program used Huffman encoding to shrink the text file before sending it.
OTHER MEANINGS
2. A lossless data compression method that builds a binary tree based on symbol frequencies.
Huffman encoding assigns shorter bit strings to more frequent characters.
3. A technique used in file formats such as JPEG and MP3 as one of their compression steps.
The image was compressed using Huffman encoding after quantization.
4. A greedy algorithm that merges the two least frequent nodes repeatedly to form a code tree.
Students implemented Huffman encoding to see how a priority queue builds the tree.