good chemistry is complicated, and a little bit messy -LW |
|
PerlMonks |
Re^2: Efficient 7bit compressionby abell (Chaplain) |
on Mar 15, 2005 at 14:05 UTC ( [id://439630]=note: print w/replies, xml ) | Need Help?? |
In general, all lossless compression algorithms will produce output longer than the input for some values of the input. Here is a sketchy proof: Update: I changed 1-1 with injective, which makes the statement a bit stronger and more directly related to the sketch of proof. As a side note, I should point out that compression algorithms should tend to be 1-1 anyway, so as to avoid "wasting" short strings. Cheers Antonio
In Section
Seekers of Perl Wisdom
|
|