## CS 250: Algebraic Error Correcting Codes (EE 387)

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.

Last offered: Winter 2019

## EE 178: Probabilistic Systems Analysis

Introduction to probability and its role in modeling and analyzing real world phenomena and systems. Events, sample space, probability, conditional probability, independence, Bayes rule. Discrete and continuous random variables. Functions of random variables. Parameter estimation. Expectation. Linear mean squared error (MSE) estimation. Estimating the statistics of random variables. Conditional expectation. Nonlinear MSE estimation. Moment generating function. Bounds and limit theorems. Confidence intervals. Prerequisites: basic calculus.

Terms: Spr
| Units: 4
| UG Reqs: GER:DB-EngrAppSci

Instructors:
El Gamal, A. (PI)

## EE 278: Introduction to Statistical Signal Processing

Review of basic probability and random variables. Random vectors and processes; convergence and limit theorems; IID, independent increment, Markov, and Gaussian random processes; stationary random processes; autocorrelation and power spectral density; mean square error estimation, detection, and linear estimation. Formerly
EE 278B. Prerequisites: EE178 and linear systems and Fourier transforms at the level of
EE102A,B or
EE261.

Terms: Aut
| Units: 3

Instructors:
Prabhakar, B. (PI)
;
Ghalayini, A. (TA)

## EE 387: Algebraic Error Correcting Codes (CS 250)

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.

Last offered: Winter 2019

Filter Results: