Discrete Math Seminar Fall 2008
On optimal instantaneous codes: A look at Huffman coding
Katie Haymaker, UNL; Dec 2
In 1952 MIT graduate student David Huffman developed an algorithm
for creating an optimal instantaneous code for a noiseless channel. We will
consider examples of Huffman coding and learn how this method uses code
trees to minimize average code word length.