EE 520: Topics in Communication: Network Coding
Network coding is a relatively new research area at the intersection of networking and information theory. The basic idea of network coding is to allow nodes in a network to compute functions of their incoming packets before transmitting them further. Thus it is more general than routing which is currently the dominant network information transfer paradigm. It turns out that the use of network coding can provably improve network throughput and robustness. The objective of this course is to understand the basics of network coding theory and its applications. We shall also attempt to briefly skim over the current research and open problems.
Instructor
Prof. Aditya Ramamoorthy
Department of Electrical and Computer Engineering
3222 Coover Hall
Ph: (515)-294-1583
Email: adityar AT iastate DOT edu
LaTex template for scribing notes
How to Convert PowerPoint Pictures for Use in LaTeX (useful link)
Announcements
Meeting time - Tues. and Thurs. 2:10-3:30pm, classroom - Howe 1220
Office hours - Please email me, or talk to me after class.
Please
start thinking about your projects or term papers. A good starting point would
the list of
papers. If you already have something in mind, please discuss it
with me as soon as possible.
Lecture Notes
Introduction to network coding [.pdf]
Max-flow Min-cut theorem [.pdf]
Edge-disjoint paths & introduction to finite fields.[.pdf]
Algebraic approach to network coding - I [.pdf]
Algebraic approach to network coding - II [.pdf]
Algebraic approach to network coding - III [.pdf]
Linear Information Flow Algorithm/Special network connections [.pdf]
Minimum cost multicast with network coding (LP formulation) [.pdf]