For Programmers: Free Programming Magazines  


Home > Archive > Compression > April 2006 > Re: Recursive Compression Method -- Eureka!!









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

Author Re: Recursive Compression Method -- Eureka!!
Matt Mahoney

2006-04-30, 6:55 pm

Erik Evenson wrote:
> "Jasen Betts" <jasen@free.net.nz> wrote in message
> news:695e.44542b8d.54ce7@clunker.homenet...
>
> Exactly. Some guesswork is unavoidable.
> The compression is Loussy with implicit overhead
> data to fill in the gaps.
>
> EE.


To compress: delete the file.
To decompress: guess the original content.

So why is it recursive?

-- Matt Mahoney

Erik Evenson

2006-04-30, 6:55 pm


"Matt Mahoney" <matmahoney@yahoo.com> wrote in message
news:1146414960.120337.87970@j73g2000cwa.googlegroups.com...
> Erik Evenson wrote:
>
> To compress: delete the file.
> To decompress: guess the original content.
>
> So why is it recursive?


The guessing is a lot more easier.
The choices are restricted to mostly 1, sometimes 2, and rarely more than 3
for each decompression cycle.
This system is far more superior to the always 2 for the pure guessing
route.

EE.



Sponsored Links







Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive

Copyright 2008 codecomments.com