Mutual Information || @ CMU || Lecture 24b of CS Theory Toolkit @RyanODonnellTeaching
Mutual Information || @ CMU || Lecture 24b of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded July 2020 | Updated November 2026, 3 hours ago
The basics of Mutual Information in information theoory. Lecture 24b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Resources for this lecture:
. "Elements of Information Theory" by Cover and Thomas
. Slides and notes of Mark Braverman

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/

Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
Mutual Information || @ CMU || Lecture 24b of CS Theory ToolkitMoments, Concentration, and Initializing an Array || @ CMU || Recitation 4 of CS Theory ToolkitExpander Graphs Application 1: Good Codes || @ CMU || Lecture 16b of CS Theory Toolkit#18/100: How Toggles Detective works (Part 1/2) || Quantum Computer Programming in 100 Easy Lessons#16/100: Hadamards unitary even w/ other qubits || Quantum Computer Programming in 100 Easy Lessons#57/100: Grovering with s satisfying strings || Quantum Computer Programming in 100 Easy LessonsLinear Programming: Bit Complexity || @ CMU || Lecture 17c of CS Theory Toolkit#55/100: Grovers Algorithm, Part 2 || Quantum Computer Programming in 100 Easy LessonsEntropy, and cryptographic pseudorandom generators || @ CMU || Recitation 12 of CS Theory ToolkitCSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit#32/100: Correlation of Boolean functions || Quantum Computer Programming in 100 Easy LessonsRandom Reversible Circuits || For Tim Gowerss 60th Birthday Workshop
Ryan ODonnell |

Mutual Information || @ CMU || Lecture 24b of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER