This lecture series consists of the following lectures:

Lectures 1 and 2: Information measures and typicality

Lectures 3 and 4: Discrete memoryless channels

Lectures 5 and 6: Information inequalities

Lectures 7 and 8: Network coding

Each lecture will be 1 hour long. There is no prerequisite for the lecture series except for basic knowledge on probability, linear algebra and finite fields.