-------------------------------------------<snip>-----------------------------:
That is interesting. I thought that one of the attributes of the
Huffman algorithm was that expansion due to the substitution was
impossible ...
Not impossible; rather, inevitable. Think pigeonhole principle.
----------------------------------------<unsnip>--------------------------------------
Not inevitable. Souce code usually achieves 60%-90% compression with the
hard-coded tables in use so far. But the table is biased toward source
code and doesn't work so well with load modules.
Rick
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
