djm@eecs.umich.edu (David Musliner) (06/29/91)
I'm looking for a compression algorithm which works efficiently on short strings of alphanumeric data (approx. 300 bytes). I have large samples of the data to be compressed, so could get fairly accurate frequency statistics for a Huffman coding approach. The data strings must be compressed and decompressed without reference to each other, so adaptive coding algorithms which depend on long strings are not suitable. Does anyone out there have public domain code for Huffman coding or other suitable approaches (preferably in perl [or C])? Please drop me an email note. thanx -->Dave Musliner djm@sawtooth.eecs.umich.edu