| Cal. Week
 | Lecture | Topic | Material | 
| 
 | 
 | 
 | 
 | 
| 44 | Mon, Nov 1 | Chapter 1: Introduction, What is error control coding? | Chap. 1.1-1.5 
 | 
|  |  |  | 
|  |  |  | 
| Thu, Nov 4 | Chapter 2: Principles of error control coding |  | 
|  | Channel models, Linear block codes, Syndrome decoding | Chap. 2.1-2.2 | 
|  |  |  | 
|  | 
 | 
 | 
 | 
| 45 | Mon, Nov 8 | Constructing codes from other codes, | Chap. 2.3-2.5 | 
|  | Bounds on achievable code parameters, Cyclic codes |  | 
|  |  |  | 
| Thu, Nov 11 | Convolutional codes | Chap. 2.6 
 | 
| 
 | 
 | 
 | 
 | 
| 46 | Mon, Nov 15 | Termination, Tailbiting, Puncturing, Catastrophic encoders | Chap. 2.6 cont. 
 | 
|  | Chapter 3: Optimal decoding methods |  | 
|  | Overview, MD vs BMD decoding | Chap. 3.1 | 
|  |  |  | 
|  |  |  | 
|  |  |  | 
| Thu, Nov 18 | ML Decoding, Viterbi algorithm, Trellises of block codes | Chap. 3.2-3.3 
 | 
| 
 | 
 | 
 | 
 | 
| 47 | Mon, Nov 22 | Decoding error probability, Weight enumerators | Chap. 3.4 
 | 
|  |  |  | 
|  | APP decoding, BCJR algorithm | Chap. 3.5 | 
|  |  |  | 
|  |  |  | 
| Thu, Nov 25 | Log-APP, Max-Log-APP decoding |  | 
|  | Chapter 4: Iterative decoding of concatenated codes |  | 
|  | Product codes, Parallel and serial concatenation, Turbo codes | Chap. 4.1 | 
|  |  |  | 
|  | 
 | 
 | 
 | 
| 48 | Mon, Nov 29 | Iterative decoding, Extrinsic and intrinsic L-values | Chap. 4.2 
 | 
|  | LDPC Codes, Tanner graphs, Message passing decoding | Chap. 4.3 | 
|  |  |  | 
| Thu, Dec 2 | Belief propagation, min-sum and hard-decision decoding | Chap. 4.3 cont. 
 | 
|  | Irregular LDPC codes, Protographs, Quasi-cyclic LDPC codes |  | 
|  | LDPC convolutional codes | Chap. 4.4 | 
| 
 | 
 | 
 | 
 | 
| 49 | Mon, Dec 6 | Spatial coupling |  | 
|  | Beyond coding: iterative receivers, turbo equalization | Chap. 4.5 | 
|  |  |  | 
|  |  |  | 
|  | Chapter 5: Reed-Solomon codes |  | 
|  | Non-binary codes, Parameters of RS codes | Chap. 5.1 | 
|  |  |  | 
| Thu, Dec 9 | Frequency domain representation, Encoding, Syndrome | Chap. 5.2-5.3 
 | 
|  | Error location, Key equation, Error evaluation |  | 
|  | 
 | 
 | 
 | 
| 50 | Mon, Dec 13 | Error evaluation: Forney algorithm, Euclidean algorithm, | Chap. 5.3 cont. 
 | 
|  | Berlekamp-Massey algorithm, Frequency domain error evaluation |  | 
|  |  |  | 
| Thu, Dec 16 | Summary: algebraic decoding, Weight enumerators |  | 
|  | Extension fields, Application examples | Chap. 5.4 | 
| 
 | 
 | 
 | 
 |