Author Page
Algoritam LZSS
A discussion of LZSS in Croatian.
This link points to an archived site, as the original has disappeared. Links on the archived page may or may not work properly.
Metode rjecnika
A look at lossless compression techniques, including LZ77, LZSS, LZ78, and LZW. Croatian language.
The original of this page is now missing, any help locating it would be greatly appreciated. You can find an archived copy at the link.
LZ77 compression
The definition of LZ77 from the Free On-line Dictionary of Computing.
LZ78 compression
The definition of LZ78 from the Free On-line Dictionary of Computing.
Lempel-Ziv Welch compression
The definition of LZW from the Free On-line Dictionary of Computing.
Wavelets
A big collection of links to Wavelet resources on the Web from Andreas Uhl.
MPEG Audio Resources and Software
Links to lots of info regarding the audio compression portions of the MPEG standards. This includes an overview, the MPEG Audio FAQ, pointers to resources, some free software, and test bitstreams.
Wavelet.org
The home of Wim Swelden’s monthly Wavelet Digest. The home page includes some spiffy search capabilities, back issues, and so on.
Arithmetic Coding
A concise explanation of Arithmetic Coding by Arturo Campos. The easy to read article is accompanied by snippets of pseudo code.
BWT, a transformation algorithm
Arturo Campos provides an easy-to-read explanation of the BWT transformation algorithm. This algorithm achieves very good compression ratios at relatively high speeds.
Canonical Huffman Coding
Arturo Campos descrives Canonical Huffman Coding, the technique used in the deflate algorithm made popular by PKZip. This type of Huffman coding follows some specific rules regarding the structure of the Huffman tree that simplify the process of transmitting the tree.
When Fibbonaci and Huffman Met
Arturo Campos describes the circumstances that lead to a Huffman tree with the worst possible code lengths.
Flexible parsing
Arturo Campos explains how your implentation of an LZ77 compressor might benefit from an improved parsing algorithm. Instead of always using the longest match found at at the current position, Flexible Parsing attempts to find the optimal match which will lead to the best overall compresion.
LZ77 the basics of compression (2st ed.)
Arturo Campos explains some of the basics about LZ77 compression and its popular descendant, LZSS. This is one of Arturo’s longer articles, and it includes a hefty does of 80×86 code for illustration purposes.
Lzp
Arturo Campos presents the LZP algorithm, first described by Charles Bloom. LZP is a hybrid of dictionary based coding and statistical modeling. This means it has some of the elements of popular LZSS encoders, but takes advantage of PPM style modeling as well. The combination of the two leads to very good compression ratios.
Lzp order-3 with linked lists
Another article about LZP by Arturo Campos. This piece describes a specific implementation technique using linked lists.
Lzp research
Arturo Campos has been doing quite a bit of research on the LZP algorithm (first described by Charles Bloom.) This paper presents all of his results to date.
Lzw, gif decoding
Arturo Campos describes the specific implementation of LZW compression used in GIF files.
Move to front
The MTF algorithm is not very exciting, but it does a really nice job of compressing streams that have been put through the BWT transform. Arturo Campos gives an explanation of how to implement it in this paper.
Optimizing putbits
Most compression programs need to be able to do bit-oriented input and output. This is a problem, since most file systems are set up to do byte oriented I/O. Arturo Campos looks at ways to do an effective implementation of this neglected part of compression programming.
Quasi Static model
Arturo Campos describes a model for arithmetic coding which results in less compression than an adaptative one, but at much higher speeds.
Range coder
Arturo Campos describes a version of arithmetic coding which renormalizes in bytes, thus achiving twice the speed of an standard implementation and 0.01% less compression.
Run Length Encoding
Arturo Campos describes the simple RLE algorithm, used in BWT to improve sorting speed.
Static Huffman Coding
Arturo Campos describes one of the simplest yet often effective compression algorithms. Believe it or not, Huffman coding with an order-0 model is nearly 50 years old!
AOL.COM search: Home > Computers > Algorithms > Compression
The compression algorithms page under AOL.COM’s search engine.
MG Pages
Some pages that go along with the book “Managing Gigabytes”, by Witten et.al. These pages are devoted to MG, “an open-source indexing and retrieval system for text, images, and textual images.”
The New Zealand Digital Library
A tremendous selection of computer science papers, pulled in from over one thousand different CS bilbiographies. Although this page doesn’t specifically relate to data compression, it has plenty to offer the interested researcher.
CACM 87 Arithmetic Coder
A copy of the source to the seminal article in the CACM describing a scheme to perform arithmetic coding.
