Information Theory part 13: Data Compression via Huffman Coding

Channel:
Canada Art of the Problem
Subscribers:
173,000
Published on ● Video Link: https://www.youtube.com/watch?v=0mZTW88Q6DY


Duration: 4:15
33,721 views
443

What is the limit of compression? Huffman codes are introduced in order to demonstrate how entropy is the ultimate limit of compression.



Other Videos By Art of the Problem


2017-10-05What is complexity theory? (P vs. NP explained visually)
2017-05-17Turing machines explained visually
2016-11-02What is a computer? (the history covering Leibniz, Babbage & Lovelace)
2016-08-28What is Logic?
2016-05-19What is an Algorithm?
2016-04-04What is Computer Science? | The Turing test
2016-01-19The Origin and History of Computer Science?
2015-10-04Episode 3 Teaser
2014-04-15Information Theory part 15: The search for Extraterrestrial Intelligence
2014-01-08Information Theory part 14: Error correction codes (Hamming coding)
2014-01-05Information Theory part 13: Data Compression via Huffman Coding
2013-11-27Claude Shannon's Information Entropy | Information Theory Part 12
2013-06-27Information Theory part 11: Claude Shannon: A Mathematical Theory of Communication
2013-06-26Information Theory part 10: What is a Markov chain?
2013-05-31Information Theory part 9: What is a bit?
2013-05-20Fermat primality test (Prime Adventure Part 10)
2013-04-08Intro to Channel Capacity (information theory)
2013-04-08Symbol Rate (information theory)
2013-04-05Information Theory part 8: Channel capacity (baud rate)
2013-03-12Random Primality Test (Prime Adventure Part 9)
2013-03-12Random Primality Tests (Prime Adventure part 9)


Tags:
huffman codes
shannon
compression
Data Compression (Algorithm Family)
entropy
huffman code