ESE 570
Coding Theory and Applications
Course Description
Fall 2006
Instructor
Prof. Joseph A. O'Sullivan.
Jolley 411. 935-4173. jao@wustl.edu
Textbooks
Richard E. Blahut, Algebraic Codes for Data Transmission,
Cambridge University Press, Cambridge 2003.
Tom Richardson and Ruediger Urbanke, Modern Coding Theory,
http://lthcwww.epfl.ch/mct/
Time and Place
MW 8:30-10:00 a.m., Lopata 302
Grader
To be determined (hopefully).
Office Hours
2 - 4 p.m. Wednesdays.
Approximate Grading
Problem Sets: 15%
Exam 1: 35%
Final Project: 40%
Evaluation: 10%
Exam 1 date has not been set.
Catalog Description
Introduction to the algebra of finite fields. Linear block codes,
cyclic codes, BCH, and related codes for error detection and
correction. Encoder and decoder circuits and algorithms. Spectral
descriptions of codes and decoding algorithms. Code performances.
Prerequisites: None
Credit: 3 units
Comments
This will be the fourth time this course has been offered
on its current every other year schedule (Falls of even numbered years).
There are two books. Modern Coding Theory by Richardson and Urbanke will be used
for the first few lectures.
Then we will switch to what is essentially the second edition
of the book R. E. Blahut, Theory and Practice of Error Control
Codes, Reading, MA: Addison Wesley, 1984. The course has no
prerequisites. The bulk of the course (8 weeks or so) will primarily cover traditional algebraic
codes (error correcting
codes). The last four weeks or so will be devoted to emerging
codes (turbo codes, Gallager codes, low density parity check
codes). There will be some implementations of ideas early in
the course, and a project on a topic of the student's choice
on an advanced idea. Implementations will be at a high level
(using any programming language a student chooses) on coding and
decoding techniques.
This course should be accessible to:
- EE grad students who have some interest in communication theory
and in algebra
- CS grad students who have a reasonable ability in mathematics,
including an interest in algebra; interest in cryptography, database security, and
related areas are also good indicators
- Math and SSE students who have an interest in applications, particularly
in data communication theory
The grading for the course will be based primarily on a test, a
project, and ongoing participation in the course. Other factors
include faculty evaluation.
Tentative Schedule
- Introduction to coding theory, chapter 1 of Blahut's book plus material from Richardson and
Urbanke. 4 Lectures.
- Algebraic coding theory, chapters 2-9. 16 lectures.
- Codes on graphs, iterative decoding, turbo codes, low density
parity check codes. 8 lectures.
This file was created and is occasionally maintained by Joseph A. O'Sullivan. Respond
to him via jao@wustl.edu.