Article View: gnu.misc.discuss
Article #74849Re: data compression notes [Re: Anyone want ...]
From: Dan Bernstein
Date: Wed, 20 Feb 1991 12:34
Date: Wed, 20 Feb 1991 12:34
18 lines
1444 bytes
1444 bytes
In article <21698@yunexus.YorkU.CA> oz@yunexus.yorku.ca (Ozan Yigit) writes: > That is nice. I think you should publish the algorithm (and a through > analysis of it) in some respectable journal. I'm working on a paper. > Coincidentally, this month's DDJ contains some stuff on this topic, > including a compressor by Mark R. Nelson (model-2) that is 25-30% better > than compress. But how fast is it? How much memory does it use? Take, for example, the important case of people transferring news between IBM PCs with size-64K memory segments. compress works with 12 bits, or about a 6K input block size on average. yabba works with a 12K input block size. whap works with a 20K input block size. This alone gives a big improvement. Can Nelson's modeller be used in limited memory? ---Dan
Technical Details
Message-ID:
<2022:Feb2012:34:0191@kramden.acf.nyu.edu>Path:
arc1-ca.pugleaf.net!gmdzi!unido!fauern!ira.uka.de!sol.ctr.columbia.edu!zaphod.mps.ohio-state.edu!rpi!uupsi!cmcl2!kramden.acf.nyu.edu!brnstndReferences:
<812:Feb1720:37:5291@kramden.acf.nyu.edu> <21698@yunexus.YorkU.CA>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 1025b4,9f0e79e992bd718e X-Google-Attributes: gid1025b4,public X-Google-ArrivalTime: 1991-02-20 14:50:56 PST Path: arc1-ca.pugleaf.net!gmdzi!unido!fauern!ira.uka.de!sol.ctr.columbia.edu!zaphod.mps.ohio-state.edu!rpi!uupsi!cmcl2!kramden.acf.nyu.edu!brnstnd From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein) Newsgroups: gnu.misc.discuss Subject: Re: data compression notes [Re: Anyone want ...] Message-ID: <2022:Feb2012:34:0191@kramden.acf.nyu.edu> Date: 20 Feb 91 12:34:01 GMT References: <812:Feb1720:37:5291@kramden.acf.nyu.edu> <21698@yunexus.YorkU.CA> Organization: IR Lines: 18