home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!julienas!chorus!octave.chorus.fr!jloup
- From: jloup@chorus.fr (Jean-loup Gailly)
- Newsgroups: comp.compression
- Subject: Re: Fixed point of the lzw compression alg.
- Message-ID: <1438@chorus.chorus.fr>
- Date: 16 Dec 92 08:57:43 GMT
- References: <1992Dec15.165902.3227@news.uiowa.edu> <1992Dec15.172309.3667@news.uiowa.edu>
- Sender: jloup@chorus.chorus.fr
- Reply-To: jloup@chorus.fr (Jean-Loup Gailly)
- Organization: Chorus systemes, Saint Quentin en Yvelines, France
- Lines: 13
-
- Doug Jones <jones@cs.uiowa.edu> writes:
-
- > Therefore, the shortest possible fixed point for LZW (ignoring end
- > of file coding) will be something like:
- > ABCDEFGAB
- > with a letter substitution that is very carefully chosen.
-
- No. The shortest possible fixed point for LZW is the empty string.
- Since you correctly ignored the three byte magic cookie added by
- 'compress', the output of the LZW algorithm is also an empty string.
-
- Jean-loup Gailly
- jloup@chorus.fr
-