home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.compression
- Path: sparky!uunet!news.uiowa.edu!news
- From: williams@herky.cs.uiowa.edu (Kent Williams)
- Subject: Re: Fixed point of the lzw compression alg.
- Sender: news@news.uiowa.edu (News)
- Message-ID: <1992Dec15.165902.3227@news.uiowa.edu>
- Date: Tue, 15 Dec 1992 16:59:02 GMT
- References: <1gj129INNdv2@function.mps.ohio-state.edu>
- Nntp-Posting-Host: herky.cs.uiowa.edu
- Organization: University of Iowa, Iowa City, IA, USA
- Lines: 27
-
- From article <1gj129INNdv2@function.mps.ohio-state.edu>, by ren@function.mps.ohio-state.edu (Liming Ren):
- >
- > I like the lzw alg. a lot. I have a question after I studied the alg:
- >
- > Is there a fixed point for lzw? By fixed point, I mean the file is unchanged
- > after we apply the compression alg. If there is one , what is the size of
- > the shortest one?
- >
- > Just a random thought. I hope it makes sense!
- >
- >
- > Liming Ren
-
- Taking the Unix Compress. You start out with your
- intial string table containing
-
- <NO PREDECESSOR>N
-
- for N in 0..256. The code for <NO PREDECESSOR>N is N, but the code
- will be output at nine bits of precision. So any short string of symbols
- would have the extra bit inserted for each symbol. I can't think of any
- string, off the top of my head, for which the input would equal the output.
- --
- Kent Williams -- williams@cs.uiowa.edu Work(335-4496) Home(338-6053)
- There used to be an inflammatory quote here.
-
-
-