Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!seismo!utah-cs!utah-gr!thomas
From: thomas@utah-gr.UUCP (Spencer W. Thomas)
Newsgroups: net.lang.c,net.unix
Subject: Re: Wanted:Compaction Algorithm
Message-ID: <1687@utah-gr.UUCP>
Date: Wed, 19-Feb-86 21:31:27 EST
Article-I.D.: utah-gr.1687
Posted: Wed Feb 19 21:31:27 1986
Date-Received: Fri, 21-Feb-86 07:04:00 EST
References: <207@pierce.UUCP>
Reply-To: thomas@utah-gr.UUCP (Spencer W. Thomas)
Organization: University of Utah, Salt Lake City
Lines: 8
Xref: watmath net.lang.c:7920 net.unix:7150


Actually, compress works best if there are repeated SEQUENCES in the
input data.  It doesn't really matter so much how many different codes
there are, except that one is more likely to get repeated sequences if
there are fewer codes.

-- 
=Spencer   ({ihnp4,decvax}!utah-cs!thomas, thomas@utah-cs.ARPA)