Du är inte inloggad på KTH så innehållet är inte anpassat efter dina val.
Gruppwebben kommer tas bort under höstterminen 2026. Från och med den 10 november upphör möjligheten att skapa nya gruppwebbar.
Behöver du en ny samarbetsyta? Läs mer i denna nyhet och hitta alternativ.
This is for the course homepage of "EO 3240, Fundamentals of Network Coding"
Network coding is a relatively new cross-disciplined research area. It involves the areas of coding theorem, information theory, graph theory and networking. New applications of network coding have been emerging substantially for the recent years in the area of wireless communications, internetworking, content distribution, security, storage etc. The basic idea of network coding is to allow nodes in a network to compute functions of their incoming information messages 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.
Learning outcomes After the course, the students should:
(1). Know the max-achievable flow for different network setups.
(2). Know the existence and construction of network codes.
(3). Know the codes for acyclic or cyclic networks.
(4). Have mastered the algebraic forms of network coding.
(5). Know the different application approaches of network coding.
This course shall give a rigorous introduction on the fundamentals of network coding. The main contents are on the information theoretic and algebraic structure of network coding. We shall also study the existence, the complexity, the construction, and the properties of network codes. The recent topics of subspace network codes will be discussed.
Disposition Lectures, homework, final report and paper presentation
1. Raymond Yeung, “Information Theory and Network Coding”, Springer Publisher, 2008.
2. Christina Fragouli and Emina Soljanin, “Network Coding Fundamentals”, NOW publisher, 2007.
1. R. Koetter and M. Medard, “An algebraic approach to network coding,” IEEE/ACM Transactions on networking.
2. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, “A random linear network coding approach to multicast,” IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413–4430, Oct. 2006.
3. R. Koetter, F. R. Kschischang: “Coding for Errors and Erasures in Random Network Coding,” IEEE Transactions on Information Theory 54(8): 3579-3591 (2008)
The lecture is given once per week. The final results (pass or fail) are based on attendance, homework and the final report and presentation.
Attendance, if you miss more than 1 lecture, you cannot pass.
Homework, the form of homework will be decided later on.
Final report is mandatory. It should be related to the students’ own research background. That is, how the network coding can be (potentially) applied in your own area. What is the state of arts? Are there potentially some new area? Why not? The minimum requirement is 2000 Words.
Presentation is mandatory: Based on your report or a selected paper by the teacher.
1. Tue 27 jan 14:15-16:00 Lecture 1 Location: Osq. Vag. 10, 3 floor, SIP conference
2. Tue 3 feb 14:15-16:00 Lecture 2 Location: Osq. Vag. 10, 3 floor, SIP conference
3. Tue 10 feb 14:15-16:00 Lecture 3 Location: Osq. Vag. 10, 3 floor, SIP conference
4. Tue 3 mar 14:15-16:00 Lecture 4 Location: Osq. Vag. 10, 3 floor, SIP conference
5. Wed 18 mar 14:15-16:00 Lecture 5 Location: Osq. Vag. 10, 3 floor, SIP conference
6. Thu 2 apr 14:15-16:00 Lecture 6 Location: Osq. Vag. 10, 3 floor, SIP conference
7. Tue 9 feb 14:15-16:00 Lecture 7 Location: Osq, V. 10, 8floor conference room
8. Thu 16 feb 14:15-16:00 Lecture 8 Location: O. V. 10, 3floor, SIP Conference room
Examiner/Responsible
Ming Xiao <mingx@kth.se>