1. Introduction
2. Performance of Small Signal Constellations
3. Hard-decision and Soft-decision Decoding
4. Hard-decision and Soft-decision Decoding
5. Introduction to Binary Block Codes
6. Binary Block Codes (cont.)
7. Introduction to Finite Fields
8. Finite Fields (cont.)
9. Finite Fields (cont.)
10. Reed-Solomon Codes
11. Reed-Solomon Codes (cont.)
12. Reed-Solomon Codes (cont.)
13. Introduction to Convolutional Codes
14. Convolutional Codes (cont.)
15. Trellis Representations of Binary Linear Block Codes
16. Trellis Representations of Binary Linear Block Codes (cont.)
17. Codes on Graphs
18. Codes on Graphs (cont.)
19. The Sum-Product Algorithm
20. Turbo, LDPC, and RA Codes
21. Turbo, LDPC, and RA Codes (cont.)
22. Lattice and Trellis Codes
23. Lattice and Trellis Codes (cont.)
24. Linear Gaussian Channels
25. Linear Gaussian Channels (cont.)

This MIT course, 6.451 Principles of Digital Communication II, has 25 video lectures by Professor David Forney from Massachusetts Institute of Technology.  The course is the second part of a two-course sequence on digital communication. The first course is 6.450 Principles of Digital Communications I. Some of the topics included on these video lectures are trellis representations of binary linear block codes and trellis-based decoding; codes on graphs; the sum-product and min-sum algorithms; the BCJR algorithm; turbo codes, LDPC codes and RA codes; and performance of LDPC codes with iterative decoding. Finally, the course addresses coding for the bandwidth-limited regime, including lattice codes, trellis-coded modulation, multilevel coding, shaping and linear Gaussian channels.This course is the second of a two-term sequence with 6.450. The focus of these video lectures is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of 6.450 and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-decision decoding. It continues with video lectures on binary linear block codes, Reed-Muller codes, finite fields, Reed-Solomon and BCH codes, binary linear convolutional codes, and the Viterbi algorithm.