Monday, February 23, 2015

COMP6021 Class 04.1

[No recording of today's class. Sound too bad]

We played Hangman to illustrate the point that letters in English do not occur with the same frequencies.  We looked at how compression can be used to represent information using fewer bits.


We looked at Huffman's algorithm for devising optimal variable length codes.

To be honest, the video I made below says it better than I did in class anyway. (I hope my best work isn't behind me!)

Video on Variable Length Codes



I gave students an exercise to complete in time for the next class.

No comments: