🚀 go-pugleaf

Two references that you could look at :

1. Welch, Terry A., "A Technique for High Performance Data 
   Compression", IEEE Computer, Vol. 17, June 1984.

2. Huffman, D., "A Method for Constructing Minimum Redundancy
   Codes", Proceedings of the Institute of Radio Engineers,
   Vol. 40, May 1952, pp 1098-1101.

There are a couple of other good refs. that escape me right now.


-- 
-----------------------
Atul Kacker
UUCP: ...seismo!rochester!ur-tut!akk2

Another good reference that is perhaps less well known:

Victor S. Miller and Mark N. Wegman, Variations on a theme by Ziv and Lempel,
in Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds),
Springer-Verlag, 1985.

References to a number of related works can be found in this paper.
-- 
David Eppstein, eppstein@cs.columbia.edu, Columbia U. Computer Science Dept.

Reply-To:mct%praxis.uucp@ukc.ac.uk

Once apon a time, about five years ago, a UK company called DJAI, (the
authors of The Last One - a 4GL program generator) said that they had an
algorithm which would (reversibly) compress arbitrary text into 40-80 bytes.
They even had a demonstration system which claimed to show the algorithm in
operation.  

They planned to demonstrate the system by compressing the complete source
text of The Last One, copying the <80 bytes to a hand-held micro with a
printer, then decompressing and producing the total listing from the micro.

I expect the algorithm has been suppressed by the UK MoD :-)

Another reference:

  Shannon, C.E.  "Prediction and Entropy of Printed English",
  Bell Sys. Tech. J.  vol.30, pp.50-64, Jan 1951.

If you get many other replies perhaps you'd like to post a summary?

-- 
Rolf

Dept. of Computer Science,	Tel:	+44 203 523523 ext 2485
Warwick University,		JANET:	rolf@uk.ac.warwick.flame
Coventry,			UUCP:	{seismo,mcvax}!ukc!warwick!rolf
CV4 7AL
England.			"Three pints? At lunchtime?!"

In article <512@ubu.warwick.UUCP> rolf@warwick.UUCP (Rolf Howarth) writes:
>Another reference:
>
>  Shannon, C.E.  "Prediction and Entropy of Printed English",
>  Bell Sys. Tech. J.  vol.30, pp.50-64, Jan 1951.
>
>If you get many other replies perhaps you'd like to post a summary?
>
Stuff is still coming in (thanks, everyone!) ,and I haven't had time to
check all the references out. Give me about two weeks.

In article <327@vax1.ccs.cornell.edu> jsm@vax1.UUCP (Jon Meltzer) writes:
>Stuff is still coming in (thanks, everyone!) ,and I haven't had time to
>check all the references out. Give me about two weeks.

another reference :

White, Ronald G. "Compressing Image Data With Quadtrees"
		 Dr. Dobb's Journal, march 1987 page 16 ->


-- Kees

|  UUCP	  : keeshu@nikhefk.uucp  or : {[wherever]!seismo}!mcvax!nikhefk!keeshu
|  FIDO   : kees huyser at 28/9 or 500/11
|  BITNET : u00212@hasara5.bitnet
|  SNAIL  : kees huyser, NIKHEF-K, PO Box 4395, 1009 AJ Amsterdam, Netherlands

Summary:
Expires:
Sender:
Followup-To:

In article <512@ubu.warwick.UUCP> rolf@warwick.UUCP (Rolf Howarth) writes:
>Another reference:
>[...]
>If you get many other replies perhaps you'd like to post a summary?

I would very much appreciate a summary being posted.  Thanks very 
much in advance. . . .
-- 
Dick Flanagan, W6OLD
UUCP:  ...!ucbvax!decwrl!sun!plx!dick
GEnie: C.FLANAGAN
(The usual disclaimers apply)

In article <383@newton.praxis.co.uk> mct%praxis.uucp@ukc.ac.uk writes:
 >Once apon a time, about five years ago, a UK company called DJAI, (the
 >authors of The Last One - a 4GL program generator) said that they had an
 >algorithm which would (reversibly) compress arbitrary text into 40-80 bytes.
 >They even had a demonstration system which claimed to show the algorithm in
 >operation.  
 >
 >They planned to demonstrate the system by compressing the complete source
 >text of The Last One, copying the <80 bytes to a hand-held micro with a
 >printer, then decompressing and producing the total listing from the micro.
 >
 >I expect the algorithm has been suppressed by the UK MoD :-)

  This is a facinating story...  Anyone else ever hear about this?
  Anyone know -anything- (or have any guesses) about the algorithm?

--- 
John Stanley (john@viper.UUCP)
Software Consultant - DynaSoft Systems
UUCP: ...{amdahl,ihnp4,rutgers}!{meccts,dayton}!viper!john

I think the number of English words is an order of magnitute
greater than 2^14-1 (16383), especially if we count all the
forms of words (word,words,wording,worded) and common proper
names (California, Fred, ...).



Carl Kadie
University of Illinois at Urbana-Champaign
UUCP: {ihnp4,pur-ee,convex}!uiucdcs!kadie
CSNET: kadie@UIUC.CSNET
ARPA: kadie@M.CS.UIUC.EDU (kadie@UIUC.ARPA)

In article <161200002@uiucdcsb> kadie@uiucdcsb.cs.uiuc.edu writes:
>I think the number of English words is an order of magnitute
>greater than 2^14-1 (16383), especially if we count all the
>forms of words (word,words,wording,worded) and common proper
>names (California, Fred, ...).

The issue is not the number of words, but the number of often used
words.  My understanding is (although I have no sources to back up
this claim - anyone??) that the average person has a vocabulary of
aprox 10,000 words.  Actually, this would be easy to derive from all
of the news articles (a good cross section of (reasonably :-) educated
people).  I wasn't planning on going through the dictionary AARDVARK=1
etc.  Something more like (THE=1, AN=2, A=3, TO=4, etc).  

-- 

Paul Guthrie
ihnp4!ihdev!pdg			This Brain left intentionally blank.