1 paper
Mordecai Golin, Xiaoming Xu, Jiajin Yu
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The ba…