Xref: utzoo comp.dcom.modems:4170 comp.misc:6602
Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!cica!gatech!dcatla!holos0!lbr
From: lbr@holos0.uucp (Len Reed)
Newsgroups: comp.dcom.modems,comp.misc
Subject: Data Compression Primer Wanted
Message-ID: <1989Jul20.185738.3691@holos0.uucp>
Date: 20 Jul 89 18:57:38 GMT
Reply-To: lbr@holos0.UUCP (Len Reed)
Distribution: na
Organization: Holos Software, Atlanta
Lines: 18

I'm looking for a survey or primer on data compression techniques.  I need
to compress and uncompress data going over a serial line to increase the
throughput.  There is a tremendous amount of redundancy in the data, so any
reasonable technique should work.  I have severe time and space constraints,
though, so simply pulling L-Z out of the News sources probably won't work
for me.  I'm willing to give up much efficiency for space and time.

What I'm looking for is a discussion and comparision of common techniques
such as Huffman coding, L-Z, etc., ideally with algorithms or references to
where the algorithms can be found.  I don't need a rigorous mathematical
treatment of the techniques.

Thanks for any help.
-- 
Len Reed
Holos Software, Inc.
Voice: (404) 496-1358
UUCP: ...!gatech!holos0!lbr