home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!sun-barr!ames!pacbell.com!pacbell!oracle!unrepliable!bounce
- Newsgroups: comp.compression
- From: escreven@latenite.us.oracle.com (Edward Screven)
- Subject: Re: PERPETUAL MOTION
- In-Reply-To: ts@cup.portal.com's message of 24 Jul 92 04:42:17 GMT
- Message-ID: <ESCREVEN.92Jul24134328@latenite.us.oracle.com>
- Sender: usenet@oracle.us.oracle.com (Oracle News Poster)
- Nntp-Posting-Host: latenite.us.oracle.com
- Organization: Oracle Corporation, Redwood Shores CA
- References: <35610@sdcc12.ucsd.edu> <62020@cup.portal.com>
- <7486@public.BTR.COM> <62692@cup.portal.com>
- Date: Fri, 24 Jul 1992 21:43:28 GMT
- X-Disclaimer: This message was written by an unauthenticated user
- at Oracle Corporation. The opinions expressed are those
- of the user and not necessarily those of Oracle.
- Lines: 24
-
-
- > From: ts@cup.portal.com (Tim W Smith)
- > [ algorithm to compress some files of length M without expanding others ]
-
- no need to present an algorithm -- you can easily show by counting it is
- possible to build a compressor that compresses some bit strings of exactly
- length M and doesn't expand any bit string of length M since there are
- 2**(M+1) - 1 bit strings of length M or less, but only 2**M bit strings of
- length M.
-
- > However, I believe that it *DOES* provide a counterexample to the usual
- > counting argument.
-
- not really. the usual (correct) counting argument shows that a compressor
- cannot compress *all* bit strings of length M.
-
- - edward screven
- --
- -------------------------------------------------------------------------------
- Edward Screven Internet: escreven@us.oracle.com
- Senior Technical Staff Telephone: (415) 506-6126 Fax: (415) 506-7200
- Tools and Multimedia US Mail: 500 Oracle Parkway, Box 659411,
- Oracle Corporation Redwood Shores, CA 94065
- -------------------------------------------------------------------------------
-