Lecture 4 of 38Coding Theory
Minimum Distance of Codes
Dr. Andrew Thangaraj · IIT Madras
Credits and licence
- From
- Coding Theory, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Teens profiles and older. How courses are placed
All the lectures
- Introduction to Linear Block Codes
- Properties of Linear Block Codes
- Dual of Linear Block Codes
- Minimum Distance of Codes
- Operations on Codes
- Bounds on Code Parameters
- Optimal Decoders
- Syndrome Decoder, Basics of Finite Fields
- Constructions of Finite Fields
- Computations in Finite Fields
- Codes over Finite Fields, Minimal Polynomials
- BCH Codes
- BCH and RS Codes I
- BCH and RS Codes II
- Decoding BCH Codes
- Decoding RS Codes
- Coded Modulation and Soft Decision Decoding
- Optimal Decoders for BPSK and AWGN
- Bitwise Map Decoder for BPSK over AWGN
- Bitwise Map Decoder from the Dual Code
- Simulating Coded Modulation
- Union Bound, Introduction to LDPC Codes
- LDPC Codes
- Message Passing, Density Evolution Analysis
- Thresholds of LDPC Codes
- Irregular LDPC Codes
- Optimized Irregular LDPC Codes, Soft Message Passing Decoders
- Density Evolution for Soft Message Passing Decoding of LDPC Codes
- LDPC Codes in Practice
- Introduction to Convolutional Codes
- Viterbi Decoding of Convolutional Codes
- Union Bound, Recursive Convolutional Encoders
- Convolutional Codes in Practice
- BCJR Decoder
- BCJR & Max-Log-MAP Decoder, Introduction to Turbo Codes
- Turbo Decoder
- Turbo Codes in Practice
- Modern Codes