Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!ihnp4!ihdev!pdg
From: pdg@ihdev.UUCP
Newsgroups: sci.crypt,comp.sys.ibm.pc,comp.sources.wanted
Subject: Re: Need information on data compression algorithms
Message-ID: <1323@ihdev.ATT.COM>
Date: Mon, 13-Apr-87 11:12:55 EST
Article-I.D.: ihdev.1323
Posted: Mon Apr 13 11:12:55 1987
Date-Received: Wed, 15-Apr-87 01:42:48 EST
References: <528@savax.UUCP> <635@ttidca.UUCP> <4542@columbia.UUCP>
Reply-To: pdg@ihdev.UUCP (Joe Isuzu)
Organization: American Nasal Amputation Centre
Lines: 17
Xref: utgpu sci.crypt:304 comp.sys.ibm.pc:2917 comp.sources.wanted:877

In article <4542@columbia.UUCP> metzger@garfield.columbia.edu.UUCP (Perry Metzger) writes:
>Look folks, as we all know from being cryptographers (you do actually
>know a bit about the subject, don't you?) that the redundancy of
>english is NEVER estimated by anyone in his right mind at more than
>75%, so thus it is impossible to compress it beyond that in general.

Unless you take symbolic representation into account.  Say you
numbered the (2^14)-1 words, and used that to replace just the
absolute matches (forgetting about endings etc), you would already be
elimintating more than you claim, before even implementing redundancy
techniques.  If you read a little more on the subject, you would
realize there is more than one way to skin a cat.

-- 

Paul Guthrie
ihnp4!ihdev!pdg			This Brain left intentionally blank.