home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!olivea!decwrl!csus.edu!netcomsv!mork!pdh
- From: pdh@netcom.com (Phil Howard )
- Newsgroups: comp.compression
- Subject: Re: 16-1 compression
- Message-ID: <-5nm+jk.pdh@netcom.com>
- Date: 29 Jul 92 20:00:57 GMT
- References: <1992Jul28.165529.18628@lugb.latrobe.edu.au> <1992Jul28.233030.19035@s1.gov>
- Organization: Netcom - Online Communication Services (408 241-9760 guest)
- Lines: 18
-
- lip@s1.gov (Loren I. Petrich) writes:
-
- > It is easy to show that _lossless_ compression (where one can
- >recover the original file without corruption) of any possible file is
- >an impossibility. This comes from counting the number of possible
- >files of a given length and pointing out that the number of compressed
- >files is less than the number of original files. Thus, there will be
- >at least one compressed file which will map onto more than one of the
- >original files.
-
- On the other hand it is possible to make sure that no "bad case" files
- will get larger by more than 1 bit, but this also adds 1 bit to all the
- other files, too.
- --
- /***********************************************************************\
- | Phil Howard --- KA9WGN --- pdh@netcom.com | "The problem with |
- | depending on government is that you cannot depend on it" - Tony Brown |
- \***********************************************************************/
-