Learn · An Introduction to Coding Theory
Lecture 13 of 33Week 3
Bounds on the Size of a Code
Prof. Adrish Banerjee · IIT Kanpur
Credits and licence
- From
- An Introduction to Coding Theory, IIT Kanpur (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
- Tweens profiles and older. How courses are placed
All the lectures
- Introduction to Error Control Coding-I
- Introduction to Error CoIntrol Coding-II
- Introduction to Error Control Coding-III
- Introduction to Linear Block Codes, Generator Matrix and Parity Check Matrix
- Syndrome, Error Correction and Error Detection
- Problem Solving Session-I
- Decoding of Linear Block Codes
- Distance Properties of Linear Block Codes-I
- Distance Properties of Linear Block Codes-II
- Problem Solving Session-II
- Some Simple Linear Block Codes-I
- Some Simple Linear Block Codes-II: Reed Muller Codes
- Bounds on the Size of a Code
- Problem Solving Session-III
- Introduction to Convolutional Codes-I: Encoding
- Introduction to Convolutional Codes-II: State Diagram, Trellis Diagram
- Convolutional Codes: Classification, Realization
- Convolutional Codes:Distance Properties
- Decoding of Convolutional Codes-I: Viterbi Algorithm
- Decoding of Convolutional Codes-II: BCJR Algorithm
- Problem solving session-IV
- Problem solving session-V
- Performance Bounds for Convolutional Codes
- Low Density Parity Check Codes
- Decoding of Low Density Parity Check Codes-I
- Decoding of Low Density Parity Check Codes-II: Belief Propagation Algorithm
- Turbo Codes
- Turbo Decoding
- Problem Solving Sessions-VI
- Distance Properties of Turbo Codes
- Convergence of Turbo Codes
- Automatic Repeat reQuest (ARQ) Schemes
- Applications of Linear Codes