|Teaching Assistant||Mahdi Jafari Siavoshani|
|Office Hours||Tuesday 16:00-18:00|
|Lectures||Tuesday 14:15-16:00 (Room:AAC114)
The class starts Feb. 22th
We will cover the basic ideas and research directions in network coding, and introduce tools used in this area.
Network coding is an area that has recently emerged, in the framework of information flow through networks. The new twist is that intermediate nodes in the network perform algebraic operations in their incoming information flows.
In this class we will cover the fundamental principles and applications of network coding. We will examine these principles in the context of several types of traffic (ex. multicasting, multiple unicast, etc). We will study design methods and implementation issues of network coding. We will then discuss benefits in terms of throughput, security, complexity etc. These ideas will be illustrated for specific applications, such as wireless networks, peer-to-peer networks and sensor networks. During the course we will make connections with areas such as linear programming, algebra, coding theory, matroids, etc.
Linear algebra. Basic knowledge of graph theory, information theory, coding theory and networking is not required, but is useful.
The course evaluation is based on a term project. The students will present their progress in the project in the middle of the semester (by April 19) and give a short report. We will also have a final presentation and report. The final presentation will be followed by asking questions like a small oral exam.
|-||Tuesday 26.04.2011 (Easter Break)|
Note: The textbook will be given to the students at the beginning of the course.