Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Random Coding: Achievability and Proof Variants
Graph Chatbot
Related lectures (30)
Previous
Page 1 of 3
Next
Information Theory: Entropy and Capacity
Covers concepts of entropy, Gaussian distributions, and channel capacity with constraints.
Architectural Technology: Project Phases and Architect Responsibilities
Discusses the phases of architectural projects and the responsibilities of architects throughout the process.
Information Theory and Coding: Source Coding
Covers source coding, encoder design, and error probability analysis in information theory and coding.
Information Theory: Source Coding
Covers source coding, typical sequences, stationarity, and efficient encoding in information theory.
Compression
Covers the concept of compression and constructing prefix-free codes based on given information.
Mutual Information and Entropy
Explores mutual information and entropy calculation between random variables.
Information Theory: Channel Capacity and Convex Functions
Explores channel capacity and convex functions in information theory, emphasizing the importance of convexity.
Error Correction Codes: Theory and Applications
Covers error correction codes theory and applications, emphasizing the importance of minimizing distance for reliable communication.
Revision: Simple Differential Amplifier
Covers the revision of a simple differential amplifier, emphasizing the importance of staying in protected mode.
Power Spectral Density Computation
Covers the computation of power spectral density and the design of communication systems.