JC>On (20 Mar 97) Herman Schonfeld wrote to Jerry Coffin...
JC>FWIW, all Huffmann coding is based on binary trees, regardless of what
JC>you're actually encoding.
Huffman encoding is slow and two much stack space is used.
JC>Arithmetic compression does work extremely well.  However, it has a
JC>couple of shortcomings.  First of all, it's considerably slower than the
JC>more common LZ and Huffman based compression schemes.  Worse, nearly the
JC>only practical method of implementing it is patented by IBM, so if you
JC>use it in a commercial product, you have to be prepared to pay
JC>royalties.  AT&T also holds a patent on an improvement in IBM's method,
JC>so to use that you pay royalties to both. (Actually, I don't know if
JC>that's still held by AT&T, or if it went to Lucent when they broke up.)
JC>    Later,
JC>    Jerry.
Ever seen fractal compression?
Compress 1024x1024x256 bitmap in mere bits.
... How come pizza gets to your house faster than the police?
--- Ezycom V1.48g0 01fd016b
---------------