Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!mips!apple!spies!zorch!xanthian From: xanthian@zorch.SF-Bay.ORG (Kent Paul Dolan) Newsgroups: comp.compression Subject: Re: Is arithmetic compression a crock? Message-ID: <1991Jun3.095919.13490@zorch.SF-Bay.ORG> Date: 3 Jun 91 09:59:19 GMT References: <1991May30.035552.14435@alembic.acs.com> Organization: SF-Bay Public-Access Unix Lines: 19 ricks@nrl.navy.mil (Richard Schumeyer) writes: > Arithmetic compression gives the best compression > for a given model. If your model stinks, so will > your compression. Did you use the static model > given in the paper? Much better text models exist, > like the string-based model in compress. Um, the code I posted was for the adaptive model of the June 1987 CACM article. There may be "string based models" in arithmetic compression, but I don't know of them. Then again, I'm no expert in the field. The advances over this primitive arithmetic compression that I know of all use multicharacter predictor methods, but that is not terribly well related to compress' strings. Kent, the man from xanth.