Abstract: Huffman codes translate letters from a fixed alphabet to d-ary codewords, achieving optimal compression for a given frequency distribution of letters. There is a well-known greedy algorithm ...