|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Fall 2010 Survey and comparison of common lossless compression algorithms Michael Cayer 
ABSTRACT Lossless compression algorithms transform a given input into a smaller representation, from which the original can be recovered. The smaller representation can then be stored or transmitted more economically than the original data. This project describes several popular compression algorithms, past and present, and compares them in terms of compression ratio. Additionally, it explores a variation on the Lempel-Ziv-Storer-Szymanski (LZSS) algorithm, where present data may be expressed as past data with a mathematical operation applied. |
||||||
|
