Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uwm.edu!gem.mps.ohio-state.edu!apple!sun-barr!decwrl!decvax!ima!cfisun!lakart!dg
From: dg@lakart.UUCP (David Goodenough)
Newsgroups: comp.sources.wanted
Subject: wanted: explanation of LZ compression algorithm
Message-ID: <684@lakart.UUCP>
Date: 13 Sep 89 18:10:23 GMT
Organization: Lakart Corporation, Newton, MA
Lines: 10

I'm looking for references that explain in neophyte terms how the
LZ compression algorithm works. I am aware that it "encodes repeated
strings", but how does it decide what is to be a string that will be
encoded: for example in English, 'th' and 'the' and 'ed' might be
suitable strings, but how are such things detected?
-- 
	dg@lakart.UUCP - David Goodenough		+---+
						IHS	| +-+-+
	....... !harvard!xait!lakart!dg			+-+-+ |
AKA:	dg%lakart.uucp@xait.xerox.com			  +---+