Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^5: Efficient 7bit compression

by MidLifeXis (Monsignor)
on Mar 17, 2005 at 13:19 UTC ( [id://440365]=note: print w/replies, xml ) Need Help??


in reply to Re^4: Efficient 7bit compression
in thread Efficient 7bit compression

First, the proof (or my parsing of the proof :) changed since I first responded. If it did not change, then I offer my apologies to abell and blame it on my not consuming enough caffine.

As I read it now, the proof appears to be correct, even if you use an identity function (or something that looks like an identity function for a given x) for f(x) (example, replace all /a+/ with "a" . length($1) . "a" - a win for all /a+/ longer than 3, identity for /^[^a]*$/).

Like I said, a minor nit, which was plugged by abell or originally misread by /me.

--MidLifeXis

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (2)
As of 2024-04-20 03:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found