Information Theory, Lecture 7: Huffman and Arithmetic codes - Oxford Mathematics 3rd Year Lecture

In this seventh lecture of eight we are showing from Sam Cohen's Information Theory 3rd year course, Sam proves that Huffman’s recursive construction of a code is optimal. We also consider Arithmetic codes, which provide an alternative which has some practical advantages.

You can watch the eight lectures from the course as they appear via the playlist: https://www.youtube.com/playlist?list=PL4d5ZtfQonW3iAhXvTYCnoGEeRhxhKHMc

You can also watch many other student lectures via our main Student Lectures playlist (also check out specific student lectures playlists): https://www.youtube.com/playlist?list=PL4d5ZtfQonW0A4VHeiY0gSkX1QEraaacE

All first and second year lectures are followed by tutorials where students meet their tutor in pairs to go through the lecture and associated problem sheet and to talk and think more about the maths. Third and fourth year lectures are followed by classes.