Hamming Code and Hadamard Code - Lecture 11c of CS Theory Toolkit

Offered By: Ryan O'Donnell via YouTube

Course Description

Overview

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.

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

Code-Based Cryptography
Inria (French Institute for Research in Computer Science and Automation) via France Université Numerique Современная комбинаторика (Modern combinatorics)
Moscow Institute of Physics and Technology via Coursera An Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam Coding Theory
NPTEL via YouTube