CS 250: Algebraic Error Correcting Codes (EE 387)

Computer Science Stanford University 3.0 credits

Course Description

Introduction to the theory of error correcting codes, emphasizing algebraic constructions, and diverse applications throughout computer science and engineering. Topics include basic bounds on error correcting codes; Reed-Solomon and Reed-Muller codes; list-decoding, list-recovery and locality. Applications may include communication, storage, complexity theory, pseudorandomness, cryptography, streaming algorithms, group testing, and compressed sensing. As part of this course you will be writing mathematical proofs.

Reviews

Sign in to Review Login to Review

No reviews yet. Be the first to share your experience!

Sign in with Google Login to Review