EE231E Course Overview

Channel Coding Theory
View sample lecture.

Description of the CourseRichard Wesel
Lecture, four hours; outside study, eight hours. Fundamentals of error control codes and decoding algorithms. Topics include block codes, convolutional codes, trellis codes, and turbo codes. Letter grading.

Background students will need
Although prerequisites are not enforced for graduate students, it is strongly recommended that each student has taken a course equivalent to Probability.

About the Instructor
Richard Wesel: Richard D. Wesel is a Professor with the UCLA Electrical Engineering Department and is the Associate Dean for Academic and Student Affairs for the UCLA Henry Samueli School of Engineering and Applied Science. He joined UCLA in 1996 after receiving his Ph.D. in electrical engineering from Stanford. His B.S. and M.S. degrees in electrical engineering are from MIT. His research is in the area of communication theory with particular interest in channel coding. He has received the National Science Foundation (NSF) CAREER Award, an Okawa Foundation award for research in information theory and telecommunications, and the Excellence in Teaching Award from the Henry Samueli School of Engineering and Applied Science. He has authored or co-authored over a hundred conference and journal publications. For more about his research group see

Readings from Algebraic Codes for Data Transmission, Richard E. Blahut. In general, readings include extraneous material. Use the lectures as a guide to what is important.

Discussion Support Adam Williamson
The MSOL Program provides a PhD Candidate or a PhD student with expertise in the field to support students during the course.

View Discussion Demo for this class.

Lecture 1
     Readings: 1,2,3.5 and 12.3 (only Gilbert bound) 
     Topics: Linear Block Codes, Bounds on Hamming Distance

Lecture 2
      Reading: 3    
      Topics: The Standard Array, Syndrome Decoding, Hamming Codes

Lecture 3
      Reading: only slides     
      Topics: The Totient Theorem

Lecture 4
      Reading: 4     
      Topics: Division of Polynomials over GF(q), Minimal Polynomials, Conjugacy Classes

Lecture 5
      Readings: 5 and 6     
      Topics: Linear Cyclic Codes, BCH, and Reed Solomon Codes, the BCH Bound

Lecture 6
      Readings: 6 and 7     
      Topics: Decoding BCH and Reed Solomon Codes 

Lecture 7
      Readings: 9 and 11     
      Topics: Convolutional Codes and Viterbi Decoding

Lecture 8
      Readings: 9.10
      Topics: Catastrophic Behavior and Minimality

Lecture 9
      Reading: Handout 
      Topics: Bit Error Rates for Convolutional Codes

Lecture 10
      Reading: Ungerboeck  
      Topics: Trellis Codes, Set Partitioning and Euclidean Distance


Lecture 11
      Readings: 14.4, Shi 
      Topics: BER bounds for Trellis Codes

Lecture 12
      Reading: Handout 
      Topics: The Forward-Backward Maximum a-Posteriori Decoder

Lecture 13
      Reading: Handout 
      Topics: Turbo Codes: Introduction and Decoding

Lecture 14
      Reading: Handout 
      Topics: Uniform Interleaver Analysis of Turbo Codes

Lecture 15
      Reading: Handout 
      Topics: Turbo Encoder Design Criteria

Lecture 16
      Reading: Handout 
      Topics: Low-Density Parity Check Codes: Decoding

Lecture 17
      Reading: Handout 
      Topics: Low-Density Parity Check Codes: Design

Lecture 18
      Reading: Handout 
      Topics: Network Coding, Other Topics

Lecture 19
      Reading: Handout 
      Topics: Final Review, Final Project Due

Final Exam

View Demo for this class.