Paper Title:
Notes on Lossless Compression
Author:
Brian Smith
Main Point(s):
The paper gives a review of lossless data compression. Some main compression
algorithms are discussed, such as Huffman coding, arithmetic
coding, and substitutional compressors. Huffman coding has the
limitation of using probability as power of 1/2. Arithmatic
coding needs a certain amount of computing resource. Substitutional
compressors are commonly used in practice. Although every compression
algorithm has its own limitations, none can be found to be good for all
kinds of data.
Possible Use(s):
Based on what kind of data to be compressed, certain kinds of
compression algorithm can be chosen.
Extensions:
Maybe improvements to various compression algorithms.
Jing Huang's CS631 course page