An update of the ten year old data compression challenge. Can your algorithm compress a million random digits?

read more from this topic.....

It looks like all my long years of studying data compression might be ready to pay off: Hello Good Day, This is Troop Emonds With regards to your Company i am sending this email Regards to order some( Compression Machine )I will like to know the type and sizes you have in stock and get [...]

read more from this topic.....

I was in Christchurch, New Zealand, recently and had a chance to meet Tim for the first time in person. Tim teaches at the University of Canterbury in Christchurch, and is Deputy Head of the Computer Science and Software Engineering department. I got a chance to ask him about his work in data compression as well as one of his new areas of interest, Computer Science education.

read more from this topic.....

When I updated my LZW reference code to use the latest C++ features, I abstracted my input and output functions using templates. Data was read and written using the iostreams paradigm, which requires simple classes that implement just a few functions. Would I have been better off using the iterator paradigm instead? The C++ algorithms [...]

read more from this topic.....

In this updated look at LZW, I will first give a description of how LZW works, then describe the core C++ code that I use to implement the algorithm. I’ll then walk you through the use of the algorithm with a few varieties of I/O. Finally, I’ll show you some benchmarks and go over the history of this well-known compression algorithm.

read more from this topic.....

Newcomers to the world of data compression often stumble on this old idea in hopes of creating a novel and powerful algorithm. In a nutshell, the idea is to create an enumerative coding system that uses combinatorial numbering to identify a message, in hopes of providing a more compact representation . Unfortunately, these schemes always [...]

read more from this topic.....

The Pigeonhole Principle, also referred to as the Counting Theorem, is a handy tool for mathematicians, and naturally, computer programmers. The loose version of this principle says “After placing n pigeons into m compartments, if n is greater than m, you will find that some compartment must contain more than one pigeon.” Seems obvious, and [...]

read more from this topic.....

Jeff Bezos Hawks the Kindle It’s still not clear whether electronic books are the wave of the future or a consumer products cul-de-sac. Technology continues to improve, and there are certainly lots of good reasons for a device like Amazon’s Kindle to be the leading edge of a major wave of adoption. A few of [...]

read more from this topic.....

The IEEE has announced its list of medal winners for 2007, and this year’s Richard Hamming medal was awarded to Dr. Abraham Lempel: For pioneering work in data compression especially the Lempel-Ziv algorithm. This is a timely award, because it comes on the 30th anniversary of the publication of the first of two seminal papers [...]

read more from this topic.....

It looks like Forgent’s long run of JPEG lawsuit revenue has now officially dried up. The Austin American Statesman has an article (registration required) that says the remaining JPEG lawsuits have all been settled, with a grand total of less than $8 million from somewhere fewer than 20 defendents. Apparently, the whole JPEG lawsuit run [...]

read more from this topic.....