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: Source Coding
Graph Chatbot
Related lectures (32)
Information Theory and Coding
Covers source coding, Kraft's inequality, mutual information, Huffman procedure, and properties of tropical sequences.
Source Coding and Prefix-Free Codes
Covers source coding, injective codes, prefix-free codes, and Kraft's inequality.
Information Theory and Coding: Source Coding
Covers source coding, encoder design, and error probability analysis in information theory and coding.
Lecture: Shannon
Covers the basics of information theory, focusing on Shannon's setting and channel transmission.
Random Coding: Achievability and Proof Variants
Explores random coding achievability and proof variants in information theory, emphasizing achievable rates and architectural principles.
Information Theory: Channel Capacity and Convex Functions
Explores channel capacity and convex functions in information theory, emphasizing the importance of convexity.
Information Theory and Coding
Covers expected code word length, Huffman procedure, and entropy in coding theory.
Universal Source Coding
Covers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
Error Correction Codes: Theory and Applications
Covers error correction codes theory and applications, emphasizing the importance of minimizing distance for reliable communication.
Source Coding Theorems: Entropy and Source Models
Covers source coding theorems, entropy, and various source models in information theory.
Information Theory: Source Coding, Cryptography, Channel Coding
Covers source coding, cryptography, and channel coding in communication systems, exploring entropy, codes, error channels, and future related courses.
Information Theory: Entropy and Capacity
Covers concepts of entropy, Gaussian distributions, and channel capacity with constraints.
Universal Compression: Lempel-Ziv Method
Covers the Universal Compression using the Lempel-Ziv method and demonstrates its superiority over other methods.
Data Compression and Shannon's Theorem Summary
Summarizes Shannon's theorem, emphasizing the importance of entropy in data compression.
Coding Theorem: Proof and Properties
Covers the proof and properties of the coding theorem, focusing on maximizing the properties of lx and the achievable rate.
Data Compression: Source Coding
Covers data compression techniques, including source coding and unique decodability concepts.
Data Compression and Shannon's Theorem: Shannon's Theorem Demonstration
Covers the demonstration of Shannon's theorem, focusing on data compression.
Conditional Entropy and Information Theory Concepts
Discusses conditional entropy and its role in information theory and data compression.
Channel Coding: Theory & Coding
Covers the formation theory and coding, focusing on channel capacity and concave functions.
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.
Previous
Page 1 of 2
Next
