Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rutgers!andromeda!argus!ken
From: ken@argus.UUCP (Kenneth Ng)
Newsgroups: comp.unix.questions,comp.unix.wizards,comp.lang.c
Subject: Re: Filtering Everything
Message-ID: <824@argus.UUCP>
Date: Fri, 17-Apr-87 18:15:04 EST
Article-I.D.: argus.824
Posted: Fri Apr 17 18:15:04 1987
Date-Received: Sun, 19-Apr-87 12:45:17 EST
References: <919@watmum.UUCP> <1097@ius2.cs.cmu.edu>
Distribution: comp
Organization: NJ Instit. of Tech: TEIES Project
Lines: 25
Summary: Try looking up Lempal-Ziv
Xref: mnetor comp.unix.questions:1957 comp.unix.wizards:1955 comp.lang.c:1763

In article <1097@ius2.cs.cmu.edu>, edw@ius2.cs.cmu.edu (Eddie Wyatt) writes:
[edited query on trying to compress data coming across 1200 baud lines]
>    You may want to take a look at Huffman codes and other variations of
> frequency depended codes. 

I would recommend work done by Lempal, Ziv, and Weogman (sp).  Huffman
typically depends on having the entire file to be compressed first.  This
would be quite difficult in a terminal session (:->.  Lempal Ziv methods
build dual tree structures which are kept in sync on both ends of the
finite bandwith medium.

Just a note to the skeptics, it has been done, not on Unix, but it
has been done, and it works quite well.  What I like best is that
if you display page a, go down to page b, and then up to page a, the
second time page a is displayed, the display is much faster.

> 					Eddie Wyatt
-- 
Kenneth Ng: Post office: NJIT - CCCC, Newark New Jersey  07102
uucp !ihnp4!allegra!bellcore!argus!ken
     ***   WARNING:  NOT ken@bellcore.uucp ***
bitnet(prefered) ken@orion.bitnet

Kirk: "I don't care if you hit the broadside of a barn"
Spock: "Why should I aim at such an object?"