More probable lists. Huffman coding converts a symbol into a sequence of bits, ANS and arithmetic coders in general convert a sequence of symbols into a sequenc

More probable lists. Huffman coding converts a symbol into a sequence of bits, ANS and arithmetic coders in general convert a sequence of symbols into a sequence of bits. This means that fractional probabilities can be encoded more precisely-- Huffman codes are only optimal if your symbol probabilities are powers of two.