CSE 533: Error-Correcting Codes: Constructions and Algorithms, Autumn 2006

University of Washington Computer Science & Engineering

CSE Home

About Us

Contact Info

Course Announcement

Error-correcting codes play an important role in many areas of science and engineering. In this course, we will study the theory of error-correcting codes exclusively in the context of "channel coding" problem: We want to transmit a message across a noisy communication channel so that the receiver can determine this message despite the adverse effects of the channel.

Starting from the basics of coding theory and some of the classic theorems, constructions and algorithms of the subject, the course will discuss recent progress on error-correction algorithms for both stochastic and worst-case models of noise. List of potential topics (actual topics discussed will be a subset depending on time and class interest):

Shannon coding theorem
Noise models (worst-case, stochastic)
Basics of coding theory (definitions, combinatorial bounds,etc.)
Classical code constructions (algebraic, LDPC, concatenated, etc.)
Reed-Solomon decoding and applications
Belief progagation decoding (of LDPC codes)
Expander codes and their decoding
List decoding; achieving "list decoding capacity"
Rateless (LT) codes
Convolutional/turbo coding

Meeting times: Wednesday 3:00-4:20pm and Fridays 10:30-11:50am at CSE 403


	Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX