Re: Compression and crypto



daw@xxxxxxxxxxxxxxxxxxxxxxxx (David Wagner) writes:

Christian Siebert wrote:
What I want to say is that it would NOT be impossible to construct a
bijective compressor for grammatically correct texts (for a fixed
language). This would also mean that any (even random) input could
always be decompressed into a grammatically correct text. The problem
is that the compression stage would reject a fairly large amount of
texts ...

But it's even worse than that. Even if you did that, there would
still be other kinds of redundancy. For instance,
"Purple giraffes heal prices."
is grammatical but not terribly meaningful. You might call this
"word salad".

Nah, I call it usenet!

Phil
--
The man who is always worrying about whether or not his soul would be
damned generally has a soul that isn't worth a damn.
-- Oliver Wendell Holmes, Sr. (1809-1894), American physician and writer
.



Relevant Pages

  • Re: Compression and crypto
    ... bijective compressor for grammatically correct texts (for a fixed ... always be decompressed into a grammatically correct text. ... fraction of bogus decodings would sneak past the bogosity detector. ... you want to make exhaustive keysearch much harder. ...
    (sci.crypt)
  • Re: Compression and crypto
    ... bijective compressor for grammatically correct texts (for a fixed ... language). ... always be decompressed into a grammatically correct text. ... fraction of bogus decodings would sneak past the bogosity detector. ...
    (sci.crypt)