Date: Tue, 14 Mar 1995 21:27:18 -0500 (EST) From: Peter Dufault <dufault@hda.com> To: joerg_wunsch@uriah.heep.sax.de Cc: freebsd-hackers@FreeBSD.org Subject: Re: SCSI ASC-ASCQ descriptions Message-ID: <199503150227.VAA01047@hda.com> In-Reply-To: <199503142355.AAA01220@uriah.heep.sax.de> from "J Wunsch" at Mar 15, 95 00:55:38 am
next in thread | previous in thread | raw e-mail | index | archive | help
J Wunsch writes: > > As Peter Dufault wrote: > > > > > I'm really tempted to make a program to do this... :) > > > > Yes, I thought of that too. I even went through the effort of seeing > > how many unique words there are (about 300). > > > > If you had a clever way of finding "good overlap" I think you > > could cut the size in half or more. > > Well, in this case, even a rather simple compression scheme will do > it. Find the most common words, and -- since they consist only of > ASCII characters -- assign them ``abbrevations'' in the range of 0x80 > and up. > A good suggestion - but sort | uniq -c | tail -128 and a C program and I get (I have to code in C since I'm inadequate in perl): > Starting with 4958 bytes we will replace 3556 bytes with 1043 (129 > references, dictionary size 785 + 129 NULLS) with 1402 uncompressed > bytes remaining for 2445 bytes final total (49% compression). Still not worth the complication. Peter -- Peter Dufault Real Time Machine Control and Simulation HD Associates, Inc. Voice: 508 433 6936 dufault@hda.com Fax: 508 433 5267
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199503150227.VAA01047>