lkml.org 
[lkml]   [2003]   [Oct]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: Transparent compression in the FS
On Thu, 16 Oct 2003, John Bradford wrote:

> Quote from "Richard B. Johnson" <root@chaos.analogic.com>:
> > No! Not true. 'lossy' means that you can't recover the original
> > data. Some music compression and video compression schemes are
> > lossy. If you can get back the exact input data, it's not lossy.
>
> Sorry, I wasn't clear in my description. What I meant was that you
> can't have an algorithm that can compress all possible values of N
> bits in to less than N bits, without expanding some of them. Of
> course, you can compress N values in to <N values, compressors do that
> by definition :-)
>
> John.
>

Ahha. Yes you are provably correct unless you use some additional
"message-channel" to cheat.

Cheers,
Dick Johnson
Penguin : Linux version 2.4.22 on an i686 machine (797.90 BogoMips).
Note 96.31% of all statistics are fiction.


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:58    [W:0.080 / U:0.180 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site