Editing Huffman coding (section)

=== The canonical Huffman code ===
{{main|canonical Huffman code|l1=Canonical Huffman code}}
If weights corresponding to the alphabetically ordered inputs are in numerical order, the Huffman code has the same lengths as the optimal alphabetic code, which can be found from calculating these lengths, rendering Hu–Tucker coding unnecessary. The code resulting from numerically (re-)ordered input is sometimes called the ''canonical Huffman code'' and is often the code used in practice, due to ease of encoding/decoding. The technique for finding this code is sometimes called '''Huffman–Shannon–Fano coding''', since it is optimal like Huffman coding, but alphabetic in weight probability, like [[Shannon–Fano coding]]. The Huffman–Shannon–Fano code corresponding to the example is <math>\{000,001,01,10,11\}</math>, which, having the same codeword lengths as the original solution, is also optimal. But in ''canonical Huffman code'', the result is <math>\{110,111,00,01,10\}</math>.