Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
This lecture from the University of Oxford's Information Theory 3rd year course explores the construction of explicit codes and demonstrates how they approach optimal efficiency. Discover how prefix codes relate to rooted trees and learn the recursive construction of optimal codes in this sixth installment of Sam Cohen's eight-part series. The lecture delves into Shannon's code, a fundamental concept in information theory. Part of Oxford Mathematics' 3rd Year curriculum, this 52-minute presentation is followed by class sessions where students can further explore the mathematical concepts presented. Access the complete eight-lecture series through the provided playlist link, along with many other Oxford Mathematics student lectures available online.
