- Home
- Courses
- Electronics and Communication
- Coding Theory
Curriculum
- 1 Section
- 38 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Coding Theory38
- 2.1Introduction to Linear Block Codes
- 2.2Properties of Linear Block Codes
- 2.3Dual of Linear Block Codes
- 2.4Minimum Distance of Codes
- 2.5Operations on Codes
- 2.6Bounds on Code Parameters
- 2.7Optimal Decoders
- 2.8Syndrome Decoder, Basics of Finite Fields
- 2.9Constructions of Finite Fields
- 2.10Computations in Finite Fields
- 2.11Codes over Finite Fields, Minimal Polynomials
- 2.12BCH Codes
- 2.13BCH & RS Codes Part 1
- 2.14BCH & RS Codes Part 2
- 2.15Decoding BCH Codes
- 2.16Decoding RS Codes
- 2.17Coded Modulation & Soft Decision Decoding
- 2.18Optimal Decoders for BPSK & AWGN
- 2.19Bitwise Map Decoder for BPSK over AWGN
- 2.20Bitwise Map Decoder from the Dual Code
- 2.21Simulating Coded Modulation
- 2.22Union Bound, Introduction to LDPC Codes
- 2.23LDPC Codes
- 2.24Message Passing, Density Evolution Analysis
- 2.25Thresholds of LDPC Codes
- 2.26Irregular LDPC Codes
- 2.27Optimized Irregular LDPC Codes, Soft Message Passing Decoders
- 2.28Density Evolution for Soft Message Passing Decoding of LDPC Codes
- 2.29LDPC Codes in Practice
- 2.30Introduction to Convolutional Codes
- 2.31Viterbi Decoding of Convolutional Codes
- 2.32Union Bound, Recursive Convolutional Encoders
- 2.33Convolutional Codes in Practice
- 2.34BCJR Decoder
- 2.35BCJR & Max-Log-MAP Decoder, Introduction to Turbo Codes
- 2.36Turbo Decoder
- 2.37Turbo Codes in Practice
- 2.38Modern Codes