EE 251: Algorithmic and Combinatorial Coding Theory

← 2012-13 2013-14 2014-15 →
← 2012-13 ← 2012-13 changes (lax) changes (strict) ▾ 2014-15 → 2014-15 →

Units: 4

Hours: Seminar, 2 hours; lecture, 2 hours

Catalog page 251

Prerequisites: EE 225 or consent of instructor

Description: Explores combinatorial and algorithmic techniques in coding theory. Covers algebraic design of Bose-Chaudhuri- Hocquenghem (BCH) codes and Reed-Muller codes. Algorithmic topics include gradient-like decoding, split-syndrome techniques, and information-set decoding. Introduces decoding with polynomial complexity based on Bayesian estimation, iterative decoding, and codes on graphs. May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor. Electrical Engineering 252 / Programs and Courses

Derived Information — The following is not part of the official catalog but is computed from catalog data.
Prerequisite graph not available.