Author Page
Strmat
A collection of C programs that do string matching and pattern discovery. This appears to be free code by D. Gusfield, who also has a book called “Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology”.
One DCL reader commented The strmat package is wonderful.
MPEG LA
This company is the licensing authority created by the owners of the most or all of the patents related to MPEG. Apparently they have the authority to provide one-stop shopping for your royalty arrangements.
SQAM - Sound Quality Assessment Material
This site apparently holds a set of files that were used to evaluate MPEG audio compression algorithms.
Open Here Compression Algorithms Page
The Open Here search engine page dedicate to compression algorithms
http://www.openhere.com/science/computer-science/algorithms/compression/
OpenHere - Compression Researchers
The OpenHere search engine’s page listing people involved with compression.
http://www.openhere.com/science/computer-science/algorithms/compression/researchers/
Universal Source Encoding for Science Data
NASA says that this data compression algorithm is the Government Invention of the year. It is apparently an algorithm that can be used by spacecraft with limited transmission bandwidith.
http://web.archive.org/web/20010610231538/www.mrc.unm.edu/Uses/
Interpolative Coding at 2.8 kbps
These folks at UCSB are encoding speech at 2.8 Kbps. It sounds very good considering the bit rate. Links here to a presentation and an abstract, as well as some samples.
Tiling and Adapative Image Compression
This paper appears to discuss the concept of compressing images by breaking them down into small pieces and doing some sort of optimal compression on each piece. I assume the trick here is to locate the point of diminishing returns.
http://www.comp.nus.edu.sg/~leews/publications/tiling_rev.pdf
Data Compression from The Scientist and Engineer’s Guide to Digital Signal Processing
A sample chapter from The Scientist and Engineer’s Guide to Digital Signal Processing, which just happens to be on Data Compression. You can download this entire book for free from the web site.
However, if you wish to purchase the hardcopy, please use
this link to purchase the book through Amazon.com. Your purchase will help support […]
Abbrevia 3 by TurboPower
A Delphi VCL that adds support for Zip and CAB files to your Delphi programs. From TurboPower.
Delphi Skunkworks - Data Compression
A page full of links to data compression resources for Delphi Programmers. Mostly libraries.
Web Technologies
Byte looks back at the amazing compression claims of a company named Web Technlogies.
UFA Archiver version 0.04 Beta 1
A freeware archiver that claims high compression ratios. The hypermart web site includes two additional experimental versions of this archiver called BIX and 777.
SelfExtract-Pro
Colin Mummery has created this product which has zip/unzip capability, plus the ability to create self-extracting JAR files. It’s free.
H.263/H.263+ Research Library, Release 0.2
Bi-Level Image Coding (JBIG-2)
How Big is Nothing?
Charles Bloom puts the noggin to work on this question. It’s not as foolish as the title might make it sound.
Complexity and Entanglement
Charles Bloom thinks out loud about complexity.
Radpack.c
Charles Bloom works up a quick coder that will compress random bytes down to about 6 bits per byte. Quite a feat, but it doesn’t stand up to close scrutiny.
Notes on the MACM-96 Arithmetic Encoder
Charles Bloom talks about this encoder, along with a comment from the author of the algorithm.
Shannon’s derivation of the entropy function
Charles Bloom with his take on the work of Our Founder.
No Magic Compressors
Charles Bloom explains why there is no Santa Claus.
Minimum Entropy
Charles Bloom discusses just what Minimum Entroyp should mean to you.
RM vs. DCC95
Charles Bloom applies the taste test to two different arithmetic coders.
Blocked Entropy
More thoughts about entropy shared with us from Charles Bloom.
ACB
A post from Leonid A. Broukhis discussing the mysterious ACB compressor by George Buynovksy.
George Buynovsky’s Post on ACB
ACB is poorly understood. The author, George Buynovsky, has only made a few public comments on the algorithm. This is one of them.
Peter Fenwick’s LZP = BlockSort = Shannon
Part of a conversation between Peter Fenwick and Charles Bloom.
Some notes on implementing Arithcoders
Parts of an email conversation between Charles Bloom and Mark Carrol.
