Group 5 - Lempel-Ziv Codes Group 5 Christopher Breen, Matt...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Group 5 Christopher Breen, Matt Edelman, Richard Lai, Alan Ness EEL 3531 - Information Theory - Spring 2009 Instructor: Dr. Mark Llewellyn Lempel-Ziv Codes
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
What is Lempel-Ziv? Lempel-Ziv is an Algorithm to compress data using an index table Created by Abraham Lempel, Jacob Ziv, and Terry Welch. Computer Algorithm A procedure for solving a mathematical problem (as of finding the greatest common divisor) in a finite number of steps that frequently involves repetition of an operation http://www.merriam-webster.com/dictionary/algorithm
Background image of page 2
Ziv and Lempel: Compression The Algorithm is fast and easy to implement as long as the data structure is simple. The parsing rule introduced by Ziv and Lempel in 1978 [ZivL’78] has been the origin of a number of fast, lossless data compression algorithms Among them LZW, the basis of UNIX “compress” utility Introduction to compression file systems that allow for large file sizes and file transfers to be smaller whilst maintaining the integrity of the original data.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 13

Group 5 - Lempel-Ziv Codes Group 5 Christopher Breen, Matt...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online