| David A. Scott 2005-11-21, 6:55 pm |
| "nightlight" <nightlight@omegapoint.com> wrote in
news:1132578897.515493.322300@g14g2000cwa.googlegroups.com:
>
> If you think someone can do it, code via AC only the less frequent
> symbol and just skip over the most frequent symbol and still use the
> single O(n^2) table for all probabilities, post a link to a paper
> showing that and I will show you where the error in their proof was.
>
>
How about you stating what you feel a typical binary zero order
based arthmetic coder would code one thousand bytes of all zero
followed by one thousand bytes of all ones. Acatually a good zero
order binary bit compressor would as a limit compress any permutation
of the above bit string to the same length file give or take one byte.
How good can your coder do. Or is it that you can't do something this
simple?
David A. Scott
--
My Crypto code
http://bijective.dogma.net/crypto/scott19u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link"
|