New combinatorial coder: WHERE'S THE BEEF

New combinatorial coder: WHERE'S THE BEEF

Post by David A. S » Wed, 23 Nov 2005 00:54:22


"nightlight" < XXXX@XXXXX.COM > wrote in



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://www.yqcomputer.com/
http://www.yqcomputer.com/
My Compression code http://www.yqcomputer.com/
**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"