[lkml]   [2003]   [Oct]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: 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?
    Muli Ben-Yehuda

    [unhandled content-type:application/pgp-signature]
     \ /
      Last update: 2005-03-22 13:58    [W:0.017 / U:10.000 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site