Notes 17 for Cs 170 1 the Lempel-ziv Algorithm

Abstract

There is a sense in which the Huffman coding was " optimal " , but this is under several assumptions: 1. The compression is lossless, i.e., uncompressing the compressed file yields exactly the original file. When lossy compression is permitted, as for video, other algorithms can achieve much greater compression, and this is a very active area of research… (More)

Topics

1 Figure or Table

Cite this paper

@inproceedings{WagnerNotes1F, title={Notes 17 for Cs 170 1 the Lempel-ziv Algorithm}, author={David Wagner} }