 Using this feature results in a maximal expansion of around 1.015, but generally less.This expansion is likely to be greatly over-shadowed by the advantage of selecting more appropriate Huffman tables, and the common-case of continuing to use the same Huffman table is represented as a single bit.Rather than unary encoding, effectively this is an extreme form of a Huffman tree, where each code has half the probability of the previous code.