Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!seismo!caip!topaz!pierce!pkm
From: pkm@pierce.UUCP (P.K. Maheshwari)
Newsgroups: net.lang.c,net.unix
Subject: Wanted:Compaction Algorithm
Message-ID: <207@pierce.UUCP>
Date: Wed, 19-Feb-86 14:26:05 EST
Article-I.D.: pierce.207
Posted: Wed Feb 19 14:26:05 1986
Date-Received: Fri, 21-Feb-86 05:48:04 EST
Organization: AT&T Bell Laboratories, Liberty Corner
Lines: 22
Xref: watmath net.lang.c:7915 net.unix:7147


	TO WHOM IT MAY CONCERN
	----------------------

I am in need of a packing algorithm which works better than the
PACK Utility of UNIX.  I have also looked at COMPRESS ( developed
at University of Utah ).  COMPRESS works great if distinct number
of input bytes is small.  But if the distinct input bytes reach
256 ( binary data ), PACK works better than COMPRESS.  With PACK
I am getting a saving of 20-25%.  If anybody has an algorithm
that would do better in packing "load modules", I would like to
know about it.

THNX...........Padam

Name:			Padam Maheshwari
Phone:			(201) 580-4552
Organization:		AT&T Bell Labs
Address:		3ND15
			184 Liberty Corner Rd
			Warren, NJ 07060-0908
NET Mail Address:	ihnp4!pierce!pkm