An Introduction to Coding Theory
An Introduction to Coding Theory. Instructor: Dr. Adrish Banerjee, Department of Electrical Engineering, IIT Kanpur. Error control coding is an indispensable part of any digital communication system. In this introductory course, we will discuss theory of linear block codes and convolutional codes, their encoding and decoding techniques as well as their applications in real world scenarios. Starting from simple repetition codes, we will discuss among other codes: Hamming codes, Reed Muller codes, low density parity check codes, and turbo codes. We will also study how from simple codes by concatenation we can build more powerful error correcting codes. (from nptel.ac.in)
| Lecture 13 - Bounds on the Size of a Code |
In this lecture we will answer questions such as what is the minimum number of parity bits required for a t-error correcting codes of length n. In this regard we will describe Hamming bound, Singleton bound, Plotkin bound and Gilbert Varshamov bound that gives bound linking code dimension k, codeword length n to the minimum distance d of a code. We will also describe what is meant by perfect codes and maximum distance separable codes.
Go to the Course Home or watch other lectures: