EdusalsaDiscover Your Stanford

CS 250

Algebraic Error Correcting Codes (EE 387)

  • Not Offered

3 units

Letter or Credit/No Credit

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. Prerequisites: Linear algebra, basic probability (at the level of, say, CS109, CME106 or EE178) and "mathematical maturity" (students will be asked to write proofs). Familiarity with finite fields will be helpful but not required.

Course Prequisites

CS 250 is useful for

Sign Up

To save CS 250 to your course bucketlist

Already Have An Account? Log In