Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!seismo!uunet!pcrat!rick
From: rick@pcrat.UUCP
Newsgroups: comp.sources.wanted,comp.sources.d
Subject: Arithmetic Coding for Data Compression
Message-ID: <335@pcrat.UUCP>
Date: Wed, 10-Jun-87 22:01:11 EDT
Article-I.D.: pcrat.335
Posted: Wed Jun 10 22:01:11 1987
Date-Received: Sat, 13-Jun-87 06:38:57 EDT
Organization: PC Research, Inc., Tinton Falls, NJ
Lines: 16
Keywords: CACM June 1987
Xref: utgpu comp.sources.wanted:1168 comp.sources.d:762


I typed in the data compression program found in CACM June 1987, pg 520.
The compression of the adaptive model shown was slightly better than
UNIX "pack", but worse than "compress".  But the program is very small,
and uses almost no memory.

I'd like to find a better model to go with the coding algorithm.  Perhaps
something that predicts the next character frequency based on the current
character.

Any pointers or source code would be appreciated.
-- 
	Rick Richardson, President, PC Research, Inc.
(201) 922-1134 (voice, nights)   OR   (201) 834-1378 (voice, days)
		seismo!uunet!pcrat!rick
		ihnp4!castor!pcrat!rick