In this sixth lecture of eight we are showing from Sam Cohen's Information Theory 3rd year course, we describe the construction of some explicit codes, and show that these are close to optimal. We also consider how prefix codes are related to rooted trees, and hence how we can construct optimal codes recursively.
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.