dg@lakart.UUCP (David Goodenough) (09/14/89)
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 +---+