Path: utzoo!mnetor!uunet!husc6!uwvax!umn-d-ub!umn-cs!randy
From: randy@umn-cs.cs.umn.edu (Randy Orrison)
Newsgroups: comp.binaries.ibm.pc.d
Subject: Re: ZOO/ARC Discussion
Message-ID: <5199@umn-cs.cs.umn.edu>
Date: 4 May 88 03:11:52 GMT
References: <827@uvm-gen.UUCP> <21371@amdcad.AMD.COM> <1424@iscuva.ISCS.COM> <8405@iuvax.cs.indiana.edu>
Reply-To: randy@umn-cs.UUCP (Randy Orrison)
Organization: UofM Math Department
Lines: 21
Keywords: BS

In article <8405@iuvax.cs.indiana.edu> bobmon@iuvax.UUCP (RAMontante) writes:
|My own favorite compression method guarantees a 50% savings.  You just fill
|in all those empty, unused zero bits with one bits from the end of the string.
|And error detection during transmission is a snap, too -- just catch anything
|that isn't a one and turn it into a one.  Hmmm. there might be room for some
|interesting heuristic data analyses here.

You can improve on this too:  just encode the length of the resulting string
of 1 bits in binary, and apply the compression recursively.  At some point
you won't be getting any better, but that should be good enough.  Probably
get it into one byte...

|(BTW:  I favor zoo too
 Me too!

	-randy
-- 
Randy Orrison, Control Data, Arden Hills, MN		randy@ux.acss.umn.edu
(Anyone got a Unix I can borrow?)   {ihnp4, seismo!rutgers, sun}!umn-cs!randy
The best book on programming for the layman is "Alice in Wonderland";
but that's because it's the best book on anything for the layman.