Notes on Huffman Codes
Time to design Huffman Code is O(n log n) where n is the number of symbols.
Typically, for compressing a string the probabilities are chosen as the actual frequencies of the symbols in the string.
Huffman works better for larger alphabets.
There are adaptive (one pass) Huffman coding algorithms. No need to transmit code.
Huffman is still popular. It is simple and it works.