2016-2017 2017-2018 2018-2019 2019-2020 2020-2021
Browse
by subject...
    Schedule
view...
 
  COVID-19 Scheduling Updates!
Due to recent announcements about Autumn Quarter (see the President's update), please expect ongoing changes to the class schedule.

1 - 4 of 4 results for: EE178

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.
Terms: Win | Units: 3
Instructors: Wootters, M. (PI)

EE 178: Probabilistic Systems Analysis

Introduction to probability and its role in modeling and analyzing real world phenomena and systems, including topics in statistics, machine learning, and statistical signal processing. Elements of probability, conditional probability, Bayes rule, independence. Discrete and continuous random variables. Signal detection. Functions of random variables. Expectation; mean, variance and covariance, linear MSE estimation. Conditional expectation; iterated expectation, MSE estimation, quantization and clustering. Parameter estimation. Classification. Sample averages. Inequalities and limit theorems. Confidence intervals. Prerequisites: Calculus at the level of MATH 51, CME 100 or equivalent and basic knowledge of computing at the level of CS106A.
Terms: Spr | Units: 3-4 | UG Reqs: GER:DB-EngrAppSci, WAY-AQR, WAY-FR
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

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.
Terms: Win | Units: 3
Instructors: Wootters, M. (PI)
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints