Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Huffman encoder

by kh (Initiate)
on Mar 03, 2001 at 19:30 UTC ( #62010=note: print w/ replies, xml ) Need Help??

in reply to Huffman encoder

congrats BooK; although i have not tested the code i presume it is fully functional, and whatever it is quite a tour-de-force of minimalistic perl programming... was wondering if you or any others know of other compression miniatures/ other attempts at compression in perl. lempel ziv would be particularly interessant... oh, and pure perl would be a *big* plus...

Comment on Re: Huffman encoder
Replies are listed 'Best First'.
Re: Re: Huffman encoder
by BooK (Curate) on Mar 03, 2001 at 20:19 UTC

    Well, uh, I also did a Lempel-Ziv encoder/decoder pair, but I discovered that it only worked with some processors only (it is dependent on the big endian/little endian stuff). Lempel-Ziv and its derivatives are not that difficult to code. Once you get the principle (which is explained in many web sites), it's quite easy.

    And please, don't assume code is functionnal: test it, read it, try to understand how it works. Don't just believe what those evil obfuscators say. :-)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://62010]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2015-10-08 16:49 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (221 votes), past polls