Home > Archive > Compression > July 2006 > ADAPTATIVE HUFFMAN
You are viewing an archived Text-only version of the thread.
To view this thread in it's original format and/or if you want to reply to
this thread please [click here]
| Author |
ADAPTATIVE HUFFMAN
|
|
| Agueda 2006-07-11, 6:55 pm |
| Hi! I=B4m interested in Adptative Huffman algorithm and I would like to
find some implementation in C, Java or Matlab. Could you help me?
Thanks.
| |
| David A. Scott 2006-07-11, 6:55 pm |
| "Agueda" <aguedagg@gmail.com> wrote in
news:1152636141.145882.271660@p79g2000cwp.googlegroups.com:
> Hi! I´m interested in Adptative Huffman algorithm and I would like to
> find some implementation in C, Java or Matlab. Could you help me?
> Thanks.
>
>
You could check at my site I have a few. All in C.
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"
| |
| cr88192 2006-07-12, 9:55 pm |
|
"Agueda" <aguedagg@gmail.com> wrote in message
news:1152636141.145882.271660@p79g2000cwp.googlegroups.com...
> Hi! I´m interested in Adptative Huffman algorithm and I would like to
> find some implementation in C, Java or Matlab. Could you help me?
> Thanks.
just to note, if you are concerned more with speed, simplicity, or ratio
than the algo itself, then it may make more sense to look into either range
coding or bitwise arithmetic coding than adaptive huffman IMO (the reason
for this is that adaptive huffman algos tend to be fairly slow for what they
give...).
for raw speed, the best option imo is static huffman (albeit, to implement
this effectively is a lot more involved than any of the previous options).
|
|
|
|
|