Re: I know this won't work, I just want to know -why-.

"Sachin Garg" <schngrg@xxxxxxxxx> wrote in
news:1135617631.155655.22800@xxxxxxxxxxxxxxxxxxxxxxxxxxxx:

>
> But over the years I have noticed that no explanation is enough to
> justify to an "inventor" why their thoughts wont be practical. They
> some how find themselves exempted from all reasoning.
>
> Best way is for them to *see* it by themselves. After all, if they
> really believe in what they say, why not give it some more time to find
> out. And if their idea ain't worth their own time, they can stop
> assuming its worth everyone's time here.
>
> And who knows, maybe one of their ideas may click someday, ofcourse not
> for random-recursive compression, maybe just better compression than
> what we have right now.
>
>

However sometimes an "inventor" comes up with something pratical
and majority of people here seem to miss apply the facts to make them
think its wrong.
The two examples I can think of are one.
Bijective compression especially arithmetic or huffman style bijective
file compression. Arguments last for years and people who read old
papers don'r really seem to grasp the concept and leave thinking its
impossible even when working code is available. The recent long thread
where some thought they came up with a better entropy compression concept
revolved around the misunderstandings of what bijective arithmetic file
compression is.

The other example that sticks in my mind was years ago when I wrote DSC.
People seemed not capable of understanding the concepts it used though
they are simple concepts. The idea behind was to bijectively combine the
single pointer required for a full BWT. The sad thing is when one does
a normal BWT the file lenght is changed since you need to add one pointer
to the file to tell the start of the data when a reverse BWT is applied.
The question envolved adding this pointer to a file in a bijective way.
The classic eample was if the file had 256 bytes before the BWT then
after the BWT most would assume you need at least 257 bytes since the
last byte could take on 256 vlaues which is the whole range of values
needed. In most working BWT they would use either a fixed number of bytes
say 4 or some think you could add a traditional unversal number code say
elias or other. How ever this is wrong in fact it easy to combine a pointer
into a file that works for even other then 256 byte files and in the 256
case the length of combined file would be 257 bytes at most and often less,
I don't think this concept sunk into to even the average knowledgeable
reader of this forum or we would see more code that combines this pointer
in a better way than what seems to be currently done for those wish to
squeeze the most space out of a file compression using BWT



David A. Scott
--
My Crypto code
http://bijective.dogma.net/crypto/scott19u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link"

.

Relevant Pages

  • Re: A truely BIJECTIVE BWT is here!
    ... If you look at the BWT ... rotation of a given input to the same output string. ... character sequences. ... Compression speed is also likely to be worse. ...
    (comp.compression)
  • Re: A truely BIJECTIVE BWT is here!
    ... But it wasn't fair since you didn't use the full wrap around BWT ... But when you add the indexing your see its not ... this is lossy compression since the index needed ... but the output is a pure BWT wrap around compression ...
    (comp.compression)
  • Re: A truely BIJECTIVE BWT is here!
    ... If you look at the BWT ... see how the transform can be reversible without additional ... Marks compressed size ... My Compression code http://bijective.dogma.net/ ...
    (comp.compression)
  • Re: A truely BIJECTIVE BWT is here!
    ... improvement in compression, ... If you look at the BWT ... The output vectors that we get are more compressible ONLY because the ... see how the transform can be reversible without additional ...
    (comp.compression)
  • WinAPI AVIMakeCompressedStream (was:Arbeitsmarktreformen)
    ... The AVIMakeCompressedStream function creates a compressed stream from an ... a pointer to the compressed stream. ... video compression. ... Pointer to a buffer that receives the compressed stream pointer. ...
    (de.talk.tagesgeschehen)