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)
Information Theory: Source Coding
Covers source coding, typical sequences, stationarity, and efficient encoding in information theory.
Random Coding: Achievability and Proof Variants
Explores random coding achievability and proof variants in information theory, emphasizing achievable rates and architectural principles.
Information Measures: Entropy and Information Theory
Explains how entropy measures uncertainty in a system based on possible outcomes.
Information Theory: Entropy and Capacity
Covers concepts of entropy, Gaussian distributions, and channel capacity with constraints.
Source Coding Theorems: Entropy and Source Models
Covers source coding theorems, entropy, and various source models in information theory.
Entropy and Data Compression: Huffman Coding Techniques
Discusses entropy, data compression, and Huffman coding techniques, emphasizing their applications in optimizing codeword lengths and understanding conditional entropy.
Mutual Information and Entropy
Explores mutual information and entropy calculation between random variables.
Information Theory and Coding
Covers source coding, Kraft's inequality, mutual information, Huffman procedure, and properties of tropical sequences.
Information Theory: Channel Capacity and Convex Functions
Explores channel capacity and convex functions in information theory, emphasizing the importance of convexity.
Compression: Prefix-Free Codes
Explains prefix-free codes for efficient data compression and the significance of uniquely decodable codes.
Information Theory: Entropy and Information Processing
Explores entropy in information theory and its role in data processing and probability distributions.
Information Theory: Review and Mutual Information
Reviews information measures like entropy and introduces mutual information as a measure of information between random variables.
Source Coding Theorem
Explores the Source Coding Theorem, entropy, Huffman coding, and conditioning's impact on entropy reduction.
Source Coding and Prefix-Free Codes
Covers source coding, injective codes, prefix-free codes, and Kraft's inequality.
Error Correction Codes: Theory and Applications
Covers error correction codes theory and applications, emphasizing the importance of minimizing distance for reliable communication.
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.
Data Compression and Shannon's Theorem: Shannon's Theorem Demonstration
Covers the demonstration of Shannon's theorem, focusing on data compression.
Information in Networked Systems: Functional Representation and Data Compression
Explores traditional information theory, data compression, data transmission, and functional representation lemmas in networked systems.
Data Compression and Shannon's Theorem: Performance Analysis
Explores Shannon's theorem on data compression and the performance of Shannon Fano codes.
Universal Source Coding
Covers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
Previous
Page 1 of 2
Next
