k-wise Independent Generators || @ CMU || Lecture 12c of CS Theory Toolkit
Pairwise independent, and more generally k-wise independent, pseudorandom generators: definitions, an application, and how to construct them from error-correcting codes. Lecture 12c 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:
. van Melkebeek lecture notes for CS880 at UW-Madison: http://pages.cs.wisc.edu/~dieter/Cour...
. Vadhan's monograph "Pseudorandomness": https://people.seas.harvard.edu/~sali...
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Filmed by Cole H. for Panopto (http://www.panopto.com/)
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)