Twisted Puppet
Here is a quick sample code:
1011011010101011
Compressing (without command section, this is to small a file to actually compress)
1 1 0
1 1 1
1 0
1 1 1
1 0
1 0
1 0
1 1 1
After huffman
111110010000010011
Step to undo is simple
Reverse Huffman (well known, proven in so many different forums, papers, etc)
Then Start counting in file #1, if bit is 1, then next bit is located in file 2. If thats a 1 then next bit is in file #3. Next bit is located in file 1 then regardless. If you find a 0 the next bit is located in file #1. Always take the left most bit.
It has no complexity, involves no time increase that I can detect. In fact due to the fact it does not need to do various count features the compression stage requires, it can go ahead and just decompress... so much faster than the compression stage.
Doomer no one has stepped up yet in full, but a couple are trying... plus the two people I am emailing who feel like the anti-global warming scientists with me in this tidal wave, and a few others.
And still no one wishes to try the challenge?
Everything bad in the economy is now Obama's fault. Every job lost, all the debt, all the lost retirement funds. All Obama. Are you happy now? We all get to blame Obama!
Kemp currently not being responded to until he makes CONCISE posts.
Avogardo and Noir ignored by me for life so people know why I do not respond to them. (Informational)