Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re^2: When should a wheel be reinvented

by ysth (Canon)
on Jun 30, 2004 at 17:49 UTC ( #370839=note: print w/replies, xml ) Need Help??


in reply to Re: When should a wheel be reinvented
in thread When should a wheel be reinvented

May I direct you to Red Perl Part I?

BTW, Huffman coding is a lousy (not lossy, lousy) compression technique.

  • Comment on Re^2: When should a wheel be reinvented

Replies are listed 'Best First'.
Re^3: When should a wheel be reinvented
by demerphq (Chancellor) on Jun 30, 2004 at 18:05 UTC
      Huffman coding (with a translation table tailored to the data) guarantees the least number of generated bits possible while encoding each character (or whatever the input unit is) separately. But in most data, there is some correlation of each character to the ones around it that can be used to achieve better compression.

        Right. Also transmitting the table is inefficient as well (although there is always adaptive huffman encoding, which i never got around to implementing). But you may find LZW Demystified and RFC: Compress::LZW interesting. :-)

        Actually in my experiments my implementation is more efficient than straight LZW because it doesnt lose bits by packing things into words. But that also means its not binary compatible which makes it more or less useless.


        ---
        demerphq

          First they ignore you, then they laugh at you, then they fight you, then you win.
          -- Gandhi


Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (11)
As of 2019-10-15 10:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?