Mod-01 Lec-01 Course Overview & Basics

Mod-01 Lec-02 Example Codes and their Parameters

Mod-02 Lec-03 Mathematical Preliminaries: Groups

Mod-02 Lec-04 Subgroups and Equivalence Relations

Mod-02 Lec-05 Cosets, Rings & Fields

Mod-03 Lec-06 Vector Spaces, Linear

Mod-03 Lec-07 Linear Codes, & Linear independence

Mod-03 Lec-08 Spanning & Basis

Mod-04 Lec-09 The Dual Code

Mod-04 Lec-10 Systematic Generator Matrix

Mod-04 Lec-11 Minimum Distance of a Linear Code

Mod-05 Lec-12 Bounds on the size of a Code

Mod-05 Lec-13 Asymptotic Bounds

Mod-06 Lec-14 Standard Array Decoding

Mod-06 Lec-15 Performance Analysis of the SAD

Mod-07 Lec-16 State and Trellis

Mod-07 Lec-17 The Viterbi Decoder

Mod-07 Lec-18 Catastrophic Error Propagation

Mod-07 Lec-19 Path Enumeration

Mod-07 Lec-20 Viterbi Decoder over the AWGN Channel

Mod-08 Lec-21 Generalized Distributive Law

Mod-08 Lec-22 The MPF Problem

Mod-08 Lec-23 Further Examples of the MPF Problem

Mod-08 Lec-24 Junction Trees recap

Mod-08 Lec-25 Example of Junction Tree Construction

Mod-08 Lec-26 Message passing on the Junction tree

Mod-08 Lec-27 GDL Approach to Decoding Convolutional Codes

Mod-08 Lec-28 ML Code-Symbol Decoding of the Convolutional Code

Mod-09 Lec-29 LDPC Codes

Mod-09 Lec-30 LDPC Code Terminology

Mod-09 Lec-31 Gallager Decoding Algorithm A

Mod-09 Lec-32 BP Decoding of LDPC Codes

Mod-09 Lec-33 BP Decoding (Continued)

Mod-09 Lec-34 Density Evolution under BP decoding

Mod-09 Lec-35 Convergence & Concentration Theorem -- LDPC Codes

Mod-10 Lec-36 A Construction for Finite Fields

Mod-10 Lec-37 Finite Fields: A Deductive Approach

Mod-10 Lec-38 Deductive Approach to Finite Fields

Mod-10 Lec-39 Subfields of a Finite field

Mod-11 Lec-40 Transform Approach to Cyclic Codes

Mod-11 Lec-41 Estimating the Parameters of a Cyclic Code

Mod-11 Lec-42 Decoding Cyclic Codes