ECE 7680Lecture 6 - Data Compression
We will apply what we know of entropy to the problem of data compression. We will introduce and prove the important Kraft inequality, Shannon codes, and Huffman codes.
We are now ready to use the tools we have been building over the last few weeks to work on the problem of efficient representation of data: data compression. In order the made usable coding representations, we introduce a type of codes known as instantaneous codes, which can be decoded without any backtracking. We present the Kraft inequality, which is an important result on the lengths of codewords. Then we show how to achieve a lower bound and introduce Huffman coding.