3 ms·
“Huffman's original algorithm is optimal for a symbol-by-symbol coding with a known input probability distribution, i.e., separately encoding unrelated symbols
by kaba0 6y ago
“Huffman's original algorithm is optimal for a symbol-by-symbol coding with a known input probability distribution, i.e., separately encoding unrelated symbols in such a data stream” -wikipedia
So being pedantic, it is optimal in this specific meaning, but I don’t know about this stagnation.