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

Recent Posts

  • Google Snaps Up On2 (3 Comments)

  • Bijective BWT (29 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 (170 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 (5 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 (1 Comment)

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

MsufSort 3.0 is Around the Corner

Posted by Sachin Garg on 10th January 2007 | Permanent Link

Latest Version of Michael A Maniscalco’s Suffix Sorting implementation is out in beta. 3.0 beta is around 27% faster than 2.2.

This version has significant improvements over 2.2 including large improvements in both the induction sorting algorithms and the tandem repeat sorting algorithms. It maintains extremely fast sorting speeds on average data and is extremely robust against worst cast data.

This entry was posted on Wednesday, January 10th, 2007 at 12:36 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.