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.
Credit: May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.