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 -
Monday - 5:45 - 7:00pm and Friday - 2:00 - 3:15pm, classroom - Howe 1252
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.
October 8th October 12th is
the deadline for submitting your 1 page proposal
for either the survey or the project. Please start working right away and set
up an appointment for discussion with me.
Lecture Notes
1. Introduction. [pdf]
2. Max-Flow Min-Cut theorem. [pdf]
3. Edge-disjoint paths &
introduction to finite fields. [pdf]
4. Algebraic approach to
network coding – Part 1. [pdf]
5. Algebraic approach to
network coding – Part 2. [pdf]
6. Algebraic approach to
network coding – Part 3. [pdf]
7. Random Linear Network
Coding and practical approaches. [pdf]
8. Practical approaches (contd.)/Linear
Information Flow algorithm. [pdf]
9. Linear Information Flow
algorithm (contd.). [pdf]
10. Combination networks and
Reed-Solomon codes. [pdf]
11. Minimum cost multicast
with network coding (LP formulation). [pdf]
12. Brief introduction to
error control coding (Hamming, Singleton & Gilbert bounds). [pdf]
13. Network coding on graphs
with cycles. [pdf]
14. Brief introduction to
duality in convex optimization with applications to minimum cost flow problems.
[pdf]