Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!mcsun!corton!chorus!nocturne.chorus.fr!jloup
From: jloup@nocturne.chorus.fr (Jean-Loup Gailly)
Newsgroups: comp.compression
Subject: Re: What is LZFG?
Message-ID: <11151@chorus.fr>
Date: 25 Jun 91 09:03:47 GMT
References: <9117612.20925@mulga.cs.mu.OZ.AU>
Sender: jloup@chorus.fr
Reply-To: jloup@nocturne.chorus.fr (Jean-Loup Gailly)
Organization: Chorus systemes, Saint Quentin en Yvelines, France
Lines: 22

In article <9117612.20925@mulga.cs.mu.OZ.AU>, slf@cs.mu.OZ.AU
(Stewart Forster) writes:

| 	In a recent posting of comparing compressors, Peter Guttman made
| reference to the LZFG compression method.  Would anybody care to 
| enlighten me on this method, or at least direct me to some papers which
| describe it?  I haven't seen anything in the formal publications.

I used a variant of LZFG in the portable zip 0.8 (and abandonned it since
for a faster algorithm). The source code is available to members of
info-zip (info-zip-request@wsmr-simtel20.army.mil).
A similar variant is used in LHA 2.12. The reference is:

      Fiala,E.R., and Greene,D.H.
          Data Compression with Finite Windows, CACM, 32,4 (1989) 490-595.

Note that the LZFG algorithm is patented.

Jean-loup Gailly

Chorus systemes, 6 av G. Eiffel, 78182 St-Quentin-en-Yvelines-Cedex, France
email: jloup@chorus.fr    Tel: +33 (1) 30 64 82 79 Fax: +33 (1) 30 57 00 66