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
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 !
- run length coding
- burrows wheeler transform
for next time
Discuss how much and what we want to dig into ...