Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!sdd.hp.com!elroy.jpl.nasa.gov!ncar!gatech!prism!jp49
From: jp49@prism.gatech.EDU (PYLES,JOHN H)
Newsgroups: comp.compression
Subject: info
Message-ID: <31316@hydra.gatech.EDU>
Date: 13 Jun 91 19:20:31 GMT
Organization: Georgia Institute of Technology
Lines: 21


   A colleague of mine is trying to find ways of compressing digitized map
data.  The format is a simple 4-bit deep array, and there is some degree
of redundance (Run Length?) in both directions.  At present, there are no
restrictions in compression time, but the decompression should be something
reasonable.  No O(n^n^n!) algorithms, please.  He would (of course) prefer 
a lossless algorithm, but I would like to know what could be done with
slightly lossy ones as well.

   Please let us know of any good books, journal articles, etc. to look at
because we are both relatively new to the compression game...

                            Thanks,

                            John Pyles

-- 
PYLES,JOHN H
Georgia Institute of Technology, Atlanta Georgia, 30332
uucp:	  ...!{decvax,hplabs,ncar,purdue,rutgers}!gatech!prism!jp49
Internet: jp49@prism.gatech.edu