| Date | Thu, 16 Oct 2003 20:43:07 +0200 | From | Muli Ben-Yehuda <> | Subject | Re: Transparent compression in the FS |
| |
On Thu, Oct 16, 2003 at 07:28:59PM +0100, John Bradford wrote:
> Surely it's just common sense to say that you have to verify the whole > block - any algorithm that can compress N values into <N values is > lossy by definition. A mathematical proof for that is easy.
N values is easy. N random uncorrelated values is hard.
Pedantic, me? Never. -- Muli Ben-Yehuda http://www.mulix.org
[unhandled content-type:application/pgp-signature] |