Looking for PPMC

Article View: comp.compression.research

Article #104

Back to comp.compression.research Previous Next

#104

From: V. Phalke
Date: Thu, 12 Nov 1992 06:31

15 lines
900 bytes

I am looking for (preferably C ) the code of PPMC algo. Refer [Bell, 
Cleary, Witten -- Text Compression 1990 pp 152].

Also known as Bell-Cleary-Witten-Moffat algorithm. It uses blending
algorithms for generating an optimal arithmetic coding.

I contacted the authors but so far am `code'-less.

Thanks ...

Vidyadhar Phalke
phalke@paul.rutgers.edu================================================

p.s. If anybody is interested look at its performance in Thomborton's
paper in Oct 92 IEEE Micro.

Technical Details

Message-ID: <Nov.12.01.31.13.1992.5301@paul.rutgers.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!rutgers!igor.rutgers.edu!paul.rutgers.edu!phalke

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!rutgers!igor.rutgers.edu!paul.rutgers.edu!phalke
From: phalke@paul.rutgers.edu (V. Phalke)
Newsgroups: comp.compression.research
Subject: Looking for PPMC
Keywords: prediction by partial match
Message-ID: <Nov.12.01.31.13.1992.5301@paul.rutgers.edu>
Date: 12 Nov 92 06:31:14 GMT
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 15