Special Topics in Information Sciences and Systems - Modern Coding Theory
Error correcting codes based on sparse graphs and their associated iterative decoding algorithms have changed communications, most fundamentally by providing a practical means to closely approach Shannon capacity. Unlike classical coding theory, modern coding theory makes very little use of abstract algebra in either design or analysis. The analysis of iterative systems relies largely on methods from graph theory and probability. We will focus no the fundamental ideas and tools used to study and design these systems while examining the various forms in which they appear.
Sample reading list:
T. Richardson and R. Urbanke, Modern Coding Theory
R. Gallager, LDPC Codes
David MacKay, Information Theory, Inference and Learning Algorithms
Not Open to Freshmen.
A good understanding of linear algebra and basic probability is needed. Some background in information theory would be very helpful.
|42407||L01||3:00 pm - 4:20 pm||T Th||Friend Center of Engineering 008||Enrolled:4 Limit:25|