Bit-level compression
Manuel A. Pajuelo Gonzalez
Anybody knows where I can find a unix(linux) implementation of a
compression algorithm which
input unit is a bit (not a byte)?
That is to say, a bit-level compression algorithm.
Thanx
Tom St Denis
The only way to compress a single bit is to RLE them. Otherwise you
have to use higher order models.
Tom
--
I frag therefore I am.
SCOTT19U.ZIP_GUY
<3BDD325E...@ac.upc.es>:
I have code for a two state bijective aritmetic
compressor that may be what you want.
David A. Scott
--
SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE "OLD VERSIOM"
http://www.jim.com/jamesd/Kong/scott19u.zip
My website http://members.nbci.com/ecil/index.htm
My crypto code http://radiusnet.net/crypto/archive/scott/
MY Compression Page http://members.nbci.com/ecil/compress.htm
**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"
Mikael Lundqvist
"Manuel A. Pajuelo Gonzalez" wrote:
I'd suggest an "entropy" coder, Huffman, arithmetic or range coder.
To say that you want to compress bits, bytes, words or any other types
has no meaning, you define your model yourself.
Huffman coding can be very fast but compress worse than arithmetic
coding or the similar range coder.
I've made a very fast range coder and an order 1 coder example of it
which (probably) can improve compression.
I think it has now reached its final state, I don't think I can improve
its speed anymore.
I've just added an increment variable to the rc_model structure. The
order 1 coder, for example, needs very fast adaptation, i.e. a high
increment.
Regards,
--
Mikael Lundqvist
mailto:m...@telia.com
http://www.geocities.com/mikaellq/
http://hem.spray.se/mikael.lundqvist/
Occam's Razor:
"Keep things simple!"