NOC:An Introduction to Information Theory

Lecture 1 - Introduction

Lecture 2 - Measure of Information

Lecture 3 - Information Inequalities

Lecture 4 - Problem solving session - I

Lecture 5 - Block to Variable Length Coding - I : Prefix-free code

Lecture 6 - Block to Variable Length Coding - II : Bounds on Optimal Code Length

Lecture 7 - Block to Variable Length Coding - III : Huffman Coding

Lecture 8 - Variable to block length coding

Lecture 9 - The asymptotic equipartition property

Lecture 10 - Block to block coding of DMS

Lecture 11 - Problem solving session - II

Lecture 12 - Universal Source Coding - I : Lempel-Ziv Algorithm-LZ77

Lecture 13 - Universal source coding - II : Lempel-Ziv Welch Algorithm (LZW)

Lecture 14 - Coding of sources with memory

Lecture 15 - Channel Capacity

Lecture 16 - Joint typical sequences

Lecture 17 - Noisy channel coding theorem

Lecture 18 - Differential entropy

Lecture 19 - Gaussian channel

Lecture 20 - Parallel Gaussian channel

Lecture 21 - Problem solving session - III

Lecture 22 - Rate distortion theory

Lecture 23 - Blahut-Arimoto Algorithm

Lecture 24 - Problem solving session - IV