Explore the fundamentals of error-correcting codes in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Dive into the Hamming Code and Hadamard Code, two linear error-correcting codes with contrasting properties of rate and distance. Learn about perfect codes, Hadamard matrices, and the Schwarz Simple lemma. Gain insights from recommended resources by renowned authors in coding theory. Taught by Professor Ryan O'Donnell, this 22-minute video provides a solid foundation for research in theoretical computer science.
Hamming Code and Hadamard Code - Lecture 11c of CS Theory Toolkit
Overview
Syllabus
Intro
Error Correction
Perfect Code
Hadamard Code
Hadamard Distance
Hadamard Matrix
Schwarz Simple lemma
Schwartz Simple Proof
Taught by
Ryan O'Donnell
Related Courses
-
Linear Error Correcting Codes - Lecture 11b of CS Theory Toolkit
-
Deterministic Communication Complexity - Lecture 23b of CS Theory Toolkit
-
Linear Programming Duality - Lecture 17b of CS Theory Toolkit
-
Quantum "Supremacy" - Lecture 25 of Quantum Computation at CMU
-
Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit
-
Fast Fourier Transform - Lecture 7c of CS Theory Toolkit
