Algorithm-Huffman
view release on metacpan or search on metacpan
(or from a dictionary) to get a good assumption of the whole
character/substring counting. There could be some ASCII characters
(e.g. 'ä' in an english text), that didn't occur. To ensure that
the whole text is encodable, you simply set the counting of every
character not yet counted to zero. That guarantees that
there is an encoding/decoding bit sequences for these ones.
It also guarantees that these bit sequences are longer than
all other encoding/decoding sequences of counted characters/substrings.
The countings needn't be integers,
they could also be fractions (e.g. percentage).
=item $huff->encode_hash
Returns a reference to the encoding hash.
The keys of the encoding hash are the characters/strings passed
at the construction. The values are their bit representation.
Please note that the bit represantations are strings
of ones and zeros is returned and not binary numbers.
=item $huff->decode_hash
( run in 0.323 second using v1.01-cache-2.11-cpan-709fd43a63f )