Re: Transparent compression in the FS
From: Muli Ben-Yehuda
Date: Thu Oct 16 2003 - 13:44:41 EST
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
Attachment:
signature.asc
Description: Digital signature