Information
Theory

Spring 2017
course
navigation

Feb 2

Discuss the assigned homework due today.
I spent *way* too much time on this last night ; see hw feb2 .
Depending on where you folks are with all this and how much you want to figure out what I did ...

other lossless compression algorithms

LZW coding

Variable length symbols to Fixed length code
No dictionary needed! Computationally very fast.

arithmetic coding

See e.g. http://en.wikipedia.org/wiki/Arithmetic_coding
Very similar to Huffman, but more general: the entire message is thought of as a single long fraction. Each successive symbol is mapped into increasingly smaller numeric intervals, with the partitions of those intervals determined by the probability model.
Very cool and elegant. Often used with adaptive probabilistic models.

but wait, there's more !

Check out all the tricks in bzip2 : http://en.wikipedia.org/wiki/Bzip2

for next time

Discuss how much and what we want to dig into ...
http://cs.marlboro.edu/ courses/ spring2017/info/ notes/ Feb_2
last modified Thursday February 2 2017 3:14 am EST