The Data Compression News Blog

All about the most recent compression techniques, algorithms, patents, products, tools and events.

Subscribe

Posts: RSS Feed
Comments: RSS Feed

Sponsored Links

Recent Posts

  • Bijective BWT (6 Comments)

    David Scott has written a bijective BWT transform, which brings all the advantages of bijectiveness to BWT based compressors. Among other things, making BWT more suitable for compression-before-encryption and also give (slightly) better compression.

  • Asymmetric Binary System (113 Comments)

    Jarek Duda’s “Asymmetric Binary System” promises to be an alternate to arithmetic coding, having all the advantages, but being much simpler. Matt has coded a PAQ based compressor using ABS for back-end encoding. Update: Andrew Polar has written an alternate implementation of ABS.

  • Precomp: More Compression for your Compressed Files (3 Comments)

    So many of today’s files are already compressed (using old, outdated algorithms) that newer algorithms don’t even get a chance to touch them. Christian Schneider’s Precomp comes to rescue by undoing the harm.

  • On2 Technologies is Hiring

    There aren’t too many companies working on cutting edge codecs, and of those few this one is hiring. Best of luck.

  • China’s AVS Specifications Available (2 Comments)

    Its old news that China has developed their own Advanced Video Standard to avoid high licensing fees. English translation of the standard is now available, along with the IPR policy. Finally something technical that you can get your hands on to feed your appetite.

Hutter Prize Update

Posted by Sachin Garg on 2nd May 2007 | Permanent Link

I am sure you guys all remember the Hutter Prize.

Well it seems there is no stopping Alexander Ratushnyak, who has submitted yet another entry paq8hp11, claiming the prize. For details, rush to Hutter Prize discussion forum.

2 Responses to “Hutter Prize Update”

  1. Andrew Polar Says:
    July 3rd, 2008 at 9:52 am

    The contest is interesting but the time looks absurd. 9 hours for 100 MB file is not practical. Also each new record require longer time. Shouldn’t that be more logical to consider size multiplied by compression time as a criteria.

  2. Sachin Garg Says:
    July 3rd, 2008 at 2:05 pm

    I share your concern about some compression benchmarks ignoring time, but Hutter Prize is an exception where this is OK.

    Its not as much about compression as its about AI. Check out its rationale, it touches the speed issue.

    http://cs.fit.edu/~mmahoney/compression/rationale.html

Leave a Reply

XHTML: You can use these tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

This entry was posted on Wednesday, May 2nd, 2007 at 12:38 pm by Sachin Garg. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.