Uploaded May 2020 | Updated November 2026, 5 hours ago
Sipser--Spielman: How to get "good" binary error-correcting codes, with polynomial-time decoding up to half the minimum distance, using explicit bipartite expanders. Lecture 16b 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:
"Expander graphs and their applications", by Hoory, Linial, and Wigderson.
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/)
Sipser--Spielman: How to get "good" binary error-correcting codes, with polynomial-time decoding up to half the minimum distance, using explicit bipartite expanders. Lecture 16b 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:
"Expander graphs and their applications", by Hoory, Linial, and Wigderson.
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/)










