MP3-Beating Compression

You probably don't believe me, but if you're at all interested in my new "CAR" compression alogrithm, check this out:

The strange thing is, it works better on compressed files!
Zipping an MP3 file gives you 99% of original, but check this out!

**** TESTS ON UNCOMPRESSED FILES ****

TXT File Example
TXT File: 1,318,671
Savings: 1,308,940
CAR File: 9,731
Percent: 0.7%

WAV File Example
WAV File: 8,362,354
Savings: 8,323,477
CAR File: 38,877
Percent: 0.5%

EXE File Example
EXE File: 216,064
Savings: 213,336
CAR File: 2,728
Percent: 1.3%


**** TESTS ON ALREADY-COMPRESSED FILES ****

MP3 File Example
MP3 File: 4,961,773
Savings: 4,945,669
CAR File: 16,104
Percent: 0.3%


MPG File Example
MPG File: 5,976,068
Savings: 5,946,909
CAR File: 29,159
Percent: 0.5%

If you didn't see it first time, I compressed an MP3 file from 5 meg to 16kb.
What CAR actually does is obviously a complete secret, but I'm really really excited about it! I've been thinking of how to do it for years - but now, yay! (I figured it out playing around in QB, of all things!).
What I want to know is basically are there any sites that are relatively easy to understand that tell you how to do:

* Huffman Compression
* LZW Compression
* "Textbook" RLE Compression (I only know PCX's RLE)

I know that you use binary trees and nodes and so on but I have no idea for a software implementation!
Anyways you probably don't believe me, but I just wanna try to make the compression better.

Thanks from a very very excited
Kieren Johnstone

I agree with the fact that you can create an infinite algorithm (ie, recursive) compression, but superfluous to some minimum limit. However, to completely agree with the fact that the author of a patent is not the order of the head when he said that "you can always compress any sequence of 2 bits up to 1!"

It is very similar to the invention of recursive compression - working ... However, the program runs very slowly. Compresses to a certain limit. And slowly - this is because currently work function blunt brute force because of what you have to wait a data compression (pre-modern as concise archiving software) by several dozen KB to 1-2KB already for weeks, even months! And all that is required for the super-fold increase in the efficiency of my program - so it's help in writing a long arithmetic modules as efficiently utilizing the resources of modern CPUs. If you wish to participate in this PROJECT - I do not need financial aid (at this stage) - that will appreciate such a module by writing a long arithmetic. I myself would be happy to pay for your work in case of success. To contact e-mail: wvanea@yahoo.com