Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Information Theory and Coding: Source Coding
Graph Chatbot
Related lectures (30)
Data Compression and Shannon-Fano Algorithm
Explores the Shannon-Fano algorithm for data compression and its efficiency in creating unique binary codes for letters.
Universal Compression: Lempel-Ziv Method
Covers the Universal Compression using the Lempel-Ziv method and demonstrates its superiority over other methods.
Conditional Entropy and Information Theory Concepts
Discusses conditional entropy and its role in information theory and data compression.
Data Compression and Entropy Interpretation
Explores the origins and interpretation of entropy, emphasizing its role in measuring disorder and information content in a system.
Data Compression and Entropy 2: Entropy as 'Question Game'
Explores entropy as a 'question game' to guess letters efficiently and its relation to data compression.
Data Compression and Shannon's Theorem Summary
Summarizes Shannon's theorem, emphasizing the importance of entropy in data compression.
Lecture: Shannon
Covers the basics of information theory, focusing on Shannon's setting and channel transmission.
Claude Shannon's Story
Explores Claude Shannon's contributions to information theory and efficient communication and storage methods.
Advanced Information Theory: Random Binning
Log in to Mediaspace to watch this video
Explores random binning in advanced information theory, focusing on assigning labels based on typicality and achieving negligible error rates in source coding.
Conditional Entropy and Data Compression Techniques
Log in to Mediaspace to watch this video
Discusses conditional entropy and its role in data compression techniques.
Previous
Page 2 of 2
Next
