EE 251: Algorithmic and Combinatorial Coding Theory

← 2008-09 2009-10 2010-11 →
← 2008-09 changes (lax) changes (strict) ▾ 2013-14 → 2011-12 →

Units: 4

Hours: Seminar, 2 hours; lecture, 2 hours

Catalog page 253

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 informa- tion-set decoding. Introduces decoding with polyno- mial complexity based on Bayesian estimation, itera- tive decoding, and codes on graphs.

Credit: May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.

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