A program that helps you cook up the optimal version of your JPEG file.

http://www.winsoftmagic.com/

The Data Compression Research Center has an overview of arithmetic coding on this page.
This link points to an archived site, as the original has disappeared. Links on the archived page may or may not work properly.

http://web.archive.org/web/20020602053716/http://www.rasip.fer.hr/research/compress/algori
thms/fund/ac/index.html

A very brief overview of arithmetic coding.

http://www.zipworld.com.au/~isanta/uni/arithmetic.htm

One slide from a bigger presentation called “Morphological shape representation using the skeleton decomposition: application to image coding.”

http://ltssg3.epfl.ch/pub_files/brigger/thesis_html/node94.html

The Data Compression Reference Center wants to teach you about Run Length Encoding. A tutorial here, plus some links.
This link points to an archived site, as the original has disappeared. Links on the archived page may or may not work properly.

http://web.archive.org/web/20020214085725/http://www.rasip.fer.hr/research/compress/algori
thms/fund/rl/index.html

A specification of a file format that uses RLE.

http://www.dcs.ed.ac.uk/home/mxr/gfx/2d/RLE.txt

Summus makes an SDK that creates compressed files in a proprietary format. They give away a plugin that can be used to view the compressed files in the normally-supported browsers.

http://www.summus.com/products/sdk/

Michael Schindler’s page describing a sorting algorithm that was presented in a poster session at DCC ‘97. Links to his source code, plus links to the paper and poster in postscript format. Update: Michael has made additional source code available.

http://www.compressconsult.com/st/

Fourelle Systems, Inc.is the global market leader in accelerated content delivery. Venturi, Fourelle’s flagship product platform, speeds the performance of IP applications over WAN links including T1, frame relay, satellite, wireless, cable and dial-up. Venturi uses application level compressionand an optimized transport protocol to achieve up to 400% performance gains.

http://www.fourelle.com

Docs showing the format for the frame header. You can learn here why MP1 and MP2 files can easily be chopped up and edited, while MP3 is not so easy.

Reader Sebastian L. had this to say: It was the first description that I found and was useful. It’s not the complete standard but it’s a good starting point.

http://www.mp3-tech.org/programmer/frame_header.html

Giovanni Manzini has published papers covering a few different topics in Data Compression, including several recent works on Burrows-Wheeler algorithms. He is currently an Associate Professor of Computer Science at the Universita degli Studi del Piemonte Orientale in the the most northern reaches of Italy.

http://www.mfn.unipmn.it/~manzini/manzini_uk.html

Part of the DSP FAQ, in our case it is an answer to a speech coding question.

http://www.hr/josip/DSP/FAQ/27.html

The DSP Group makes a codec called TrueSpeech. You can get a copy of the player for free here to check out the 8.5 KBps audio it makes possible.

http://www.dspg.com/dspg/truespeech_compression.html

Christian Scheurer wrote up his LZ77 project that was targeted to the 68HC11 processor. It’s written in German, perhaps you could use Babel-fish to translate. Source code included.

http://www.mountpoint.ch/unique/project/t-rip/

This freeware program is designed to perform Internet telephony. It incorporates source for a couple of interesting speech codec, which is why it gets a link in the library.

http://www.speakfreely.org/

This lab at CMU seems to be doing some interesting things with video compression. At a minimum, they have an H.263 codec you can download.

http://amp.ece.cmu.edu/

A list of links to test images. Utopia for the benchmark junkie.

http://www.cs.cmu.edu/afs/cs/project/cil/ftp/html/v-images.html

A page devoted to image compression research at the University of Joensuu, which would appear to be in Finland. Links to more research and a PhD thesis.

http://cs.joensuu.fi/pages/franti/comp/

This bibliography is the best attempt at a complete record of all the written works of Claude Shannon, father of Information Theory.

http://www.research.att.com/~njas/doc/shannonbib.html

Two papers in which it is show how to combine the BWT with the suffix array
data structure, in order to build a sort of compressed suffix array.
In the first paper it is proven that
the space occupancy of the compressed suffix array can be bounded in
terms of the entropy of the input string. In the second paper it is
proposed and tested a practical implementation of this data structure.

The first paper will appear in the Proc. of 41st IEEE Symposium on
Foundations of Computer Science; the second one in the Proc. of the 12th
SIAM-ACM Symposium on Discrete Algorithms.

http://www.mfn.unipmn.it/~manzini/papers/focs00.html

David Scott occupies a unique niche in the world of data compression. He is very interested in how one can adapt existing compression technologies to be bijective, a term you can find defined on his web page. The stated motivation for this is to increase the difficulty of breaking an encrypted version of the file. On this page, David makes a first pass at modifying BWT to be bijective. He doesn’t quite get there, but feels that he has taken some good steps towards his goal.

http://bijective.dogma.net/compres9.htm

A good explanation on color perception. This isn’t truly a data compression topic, but it actually plays a very important role in lossy image compression schemes, so I though the library ought to have at least one or two points.

http://www.compuphase.com/cmetric.htm

A Practical Introduction To Data Compression by Alexander Ratushnyak. A Data Compression mini-FAQ with a good set of links.

http://geocities.com/eri32/int.htm

A paper by Michael A. Maniscalco that desribes an RLE algorithm tailored for use with the BWT compression technique.

http://www.geocities.com/m99datacompression/papers/rle/rle.html

A free program to create self extracting archives from Zip files. An open source program that harkens back to shareware days by asking for donations, old-school style.

http://www.disoriented.com/FreeExtractor/

A bronze statue of Claude Shannon will be unveiled on Friday, October 6, 2000 in his hometown, Gaylord, Michigan. This sculpture by Eugene Daub was commissioned by the Information Theory Society of the Institute of Electrical and Electronics Engineers (IEEE). It will be installed in the recently named Shannon Park in downtown Gaylord.

http://www.eecs.umich.edu/shannonstatue/

A small web page with some info about Claude Shannon and what he meant.

http://www.lucent.com/minds/infotheory/who.html

A short bio, plus some links to more information on Shannon.

http://www-groups.dcs.st-and.ac.uk/%7ehistory/Mathematicians/Shannon.html

A bio on Shannon, plus some links.

http://www.nightgarden.com/infosci.htm#claude

A salute to Claude Shannon from Bell Labs.

http://cm.bell-labs.com/cm/ms/what/shannonday/work.html