Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!gem.mps.ohio-state.edu!swrinde!emory!ogccse!orstcs!jacobs.cs.orst.edu!borcelf
From: borcelf@jacobs.cs.orst.edu (Fernando Borcel)
Newsgroups: comp.sources.wanted
Subject: alt.sources.wanted
Message-ID: <13904@orstcs.CS.ORST.EDU>
Date: 20 Nov 89 20:25:29 GMT
Sender: usenet@orstcs.CS.ORST.EDU
Reply-To: borcelf@jacobs.cs.orst.edu (Fernando Borcel)
Organization: Oregon State University - CS - Corvallis Oregon
Lines: 10


I'm looking for a compression algorithm to be used on text.  Somebody mentioned
Huffman's algorithm.   I saw an algorithm which used a tree for this purpose,
a few years back.  Anyway, if you have an algorithm, or a chunk of code I can
look at (comments are always nice), I'll be grateful!

		Nando
		borecelf@jacobs.cs.orst.edu

.