Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!rpi!crdgw1!ge-dab!tarpit!peora!rtmvax!dandrews
From: dandrews@rtmvax.UUCP (David Andrews)
Newsgroups: comp.theory
Subject: Re: Data compression ? (Sliding Dict + Multiple Shannon-Fano Trees)
Message-ID: <3121@rtmvax.UUCP>
Date: 28 Aug 90 02:37:54 GMT
References: <90235.203843SAAAA02@cc1.kuleuven.ac.be>
Organization: Robert Talley (PRIVATE), Orlando, FL
Lines: 13

From article <90235.203843SAAAA02@cc1.kuleuven.ac.be>, by SAAAA02@BLEKUL11.BITNET:
> Is there anybody who could explain me the following algorithms in
> brief : Data Compression with Sliding Dictionaries with Multiple
> Shannon-Fano trees ?

PKZIP uses both of these.  Phil Katz lists the following references
in the package documentation:

  Storer, James A.  "Data Compression, Methods and Theory"
  Computer Science Press, 1988

  Held, Gilbert  "Data Compression, Techniques and Applications"
  John Wiley and Sons, 1987