Lectures (Video)
- 1. Introduction Sampling Theorem
- 2. Performance of Small Signal Constellations
- 3. Hard-decision and Soft-decision Decoding
- 4. Hard-decision and Soft-decision Decoding II
- 5. Introduction to Binary Block Codes
- 6. Introduction to Binary Block Codes II
- 7. Introduction to Finite Fields
- 8. Introduction to Finite Fields II
- 9. Introduction to Finite Fields III
- 10. Reed-Solomon Codes
- 11. Reed-Solomon Codes II
- 12. Reed-Solomon Codes III
- 13. Introduction to Convolutional Codes
- 14. Introduction to Convolutional Codes II
- 15. Trellis Representations of Binary Linear Block Codes
- 16. Trellis Representations of Binary Linear Block Codes II
- 17. Codes on Graphs
- 18. Codes on Graphs II
- 19. The Sum-Product Algorithm
- 20. Turbo, LDPC, and RA Codes
- 21. Turbo, LDPC, and RA Codes II
- 22. Lattice and Trellis Codes
- 23. Lattice and Trellis Codes II
- 24. Linear Gaussian Channels
- 25. Linear Gaussian Channels II
Principles of Digital Communications II - Lecture 12
|
Get the Flash Player to view video.
Lecture 12 - Reed-Solomon Codes III
Reed-Solomon Codes III
Prof. David Forney
Principles of Digital Communication II (Massachusetts Institute of Technology: MIT OpenCourseWare) http://ocw.mit.edu Date accessed: 2009-08-03 License: Creative Commons BY-NC-SA |
