YoVDO

Data Compression I - Lecture 4: Huffman Codes

Offered By: Stanford University via YouTube

Tags

Information Theory Courses Computer Science Courses Electrical Engineering Courses Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the fundamentals of Huffman coding in this comprehensive lecture from Stanford University's EE274: Data Compression I course. Delve into the theory and applications of this essential data compression technique with Professor Tsachy Weissman, an expert in Electrical Engineering. Gain insights from additional instructors Shubham Chandak and Pulkit Tandon as they guide you through the intricacies of Huffman codes. Over the course of 75 minutes, master the concepts that form the backbone of efficient data compression algorithms. Access supplementary materials and follow along with the lecture by visiting the course website. For those interested in pursuing a deeper understanding of data compression, discover enrollment options for the full online course offered by Stanford University.

Syllabus

Stanford EE274: Data Compression I 2023 I Lecture 4 - Huffman Codes


Taught by

Stanford Online

Tags

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera
Intro to Computer Science
University of Virginia via Udacity
Analytic Combinatorics, Part I
Princeton University via Coursera
Algorithms, Part I
Princeton University via Coursera
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera