Information Theory, Lecture 8: Tunstall’s code - Oxford Mathematics 3rd Year Student Lecture скачать в хорошем качестве

Information Theory, Lecture 8: Tunstall’s code - Oxford Mathematics 3rd Year Student Lecture

In this eighth lecture of eight we are showing from Sam Cohen's Information Theory 3rd year course, after discussing arithmetic codes further, we consider codes where, instead of encoding fixed-length messages as variable-length encodings, we fix the length of the encoding and vary the input length. We present Tunstall’s algorithm for building such a code optimally. You can watch the eight lectures from the course via the playlist:    • Student Lectures - Information Theory   You can also watch many other student lectures via our main Student Lectures playlist (also check out specific student lectures playlists):    • Student Lectures - All lectures   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.