Notes on Huffman Codes
Both encoder and the decoder need the Huffman tree. Can be transmitted with compressed data.
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.