=== Modification: Fast huffmann code ===

<pre>
convert table
A  B
00 1
01 01
10 000
11 001
</pre>

You can concant 8xA for coder. Bits on input = 16 to 16, bits on output = 8 to 24. Coder can convert min 1 char to another char by table of chars + add some bits. (2001 Peter Mlich)

=== Modification: Mapping huffman code ===

You can save output bits to own array. Can create unlimited compress ratio huffmann coder.
<pre>
convert table use huffmann table
A  B0 B1 B2
00 1
01 0  1
10 0  0  0
11 0  0  1

Example:
input: 11100100
B0 = 0001 - 3:1 = zeros:ones
B1 = 001 - 2:1
B2 = 01 - 1:1
</pre>

Input, true compressed file have typical equal zeros and ones (example for huffmann). Then first map have ration zeros:ones = 3:1. B0, B1 can be compressed by huffman. You can repeat mapping and fast huffman. (2001 Peter Mlich) 

Note: B1 size is equal as numbers zeros in B0, not need save this informations.