CS395T, EE381V, M390C, Coding Theory Fall 14
Error-correcting codes provide a way to efficiently add redundancy to data,
so that the original data can be recovered even in the presence of noise.
Such codes are essential in modern communication and storage of data, where
high reliability is required. From its engineering roots, coding theory has
evolved to use sophisticated mathematical techniques, centering around
algebra but also involving probability and combinatorics. Moreover, coding
theory has recently found unexpected uses in computer science.
In this interdisciplinary course, we study coding theory from the different
perspectives of professors in math, computer science, and electrical
engineering. We develop the mathematical tools, construct important codes
and associated algorithms, and discuss applications in computer science and
Alex Dimakis (ENS 426 ph. 512-471-3068 email@example.com),
(RLM 9.122, ph. 512-471-2674, ) and
David Zuckerman (GDC 4.508, ph. 512-471-9729, firstname.lastname@example.org).
- Algebraic coding: including linear codes, finite fields, Hamming, Reed-Solomon, BCH and Golay codes.
- Algorithmic coding: including decoding algorithms, concatenated codes,
list decoding concepts, and applications to computational complexity.
- Random Coding and Communications: Shannon's coding theorem, LDPC and rateless coding, network coding and related topics.
CLASS HOURS: TTH 12:30-2:00
LOCATION: RLM 11.176
UNIQUE NUMBER: (17346 for EE381V) (53270 for CS395T) (56055 for M390C)
TEXTBOOK: Book draft by V. Guruswami, A. Rudra, and M. Sudan,
PREREQUISITES: Basic Undergraduate Algebra and Probability background
GRADING POLICY: Final Exam: 50%,
Homework, (six assignments): 40%,
The University of Texas at Austin provides upon request
appropriate academic accommodations for qualified
students with disabilities. For more information,
contact the Office of the Dean of Students at 471-
6259, 471-6441 TTY.