Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!wuarchive!psuvax1!psuvm!blekul11!saaaa02
From: SAAAA02@BLEKUL11.BITNET
Newsgroups: comp.theory
Subject: Data compression ? (Sliding Dict + Multiple Shannon-Fano Trees)
Message-ID: <90235.203843SAAAA02@cc1.kuleuven.ac.be>
Date: 23 Aug 90 20:36:43 GMT
Organization: K.U.Leuven - Academic Computing Center
Lines: 14

Is there anybody who could explain me the following algorithms in
brief : Data Compression with Sliding Dictionaries with Multiple
Shannon-Fano trees ?
Our University library doesn't seem to have books on data compression,
neither do the bookstores in our neighbourhood.
Or if it is too difficult to mail me a brief explanation, could you please
point out a few good references.
Thanks in advance !!!

Let's hope those algorithms don't get patented.



Dirk Dussart : Student Computer Science.