Introduction to Linear Network Coding
Alberto Ravagnani (Université de Neuchâtel)
Monday,
25 April 2016,
18:00,
C210 (Faculty of Computer Science, C Building, UAIC)—
map
Tuesday,
26 April 2016,
18:00,
C308 (Faculty of Computer Science, C Building, UAIC)—
map
Contents Summary
Motivating examples: the “Butterfly network”. Routing versus coding.
Definition of network and mincut between two vertices. Examples.
The min-cut bound (idea of the proof).
The “Max-Flow-Min-Cut” theorem (with proof).
Subspace codes and subspace error correction.
Read a detailed description of the lectures contents and references.
Introduction to Secure Network Coding
Dr. Ing. Elke Franz (TU Dresden)
Wednesday,
27 April 2016,
18:00,
C308 (Faculty of Computer Science, C Building, UAIC)—
map
Thursday,
28 April 2016,
18:00,
C210 (Faculty of Computer Science, C Building, UAIC)—
map
Contents Summary
Practical Network Coding
Security Requirements for Network Coding
Excursus: Cryptography
Network Coding Schemes Providing Confidentiality
Detection of Pollution Attacks
Consult the description of the lectures contents and references.
Back to EBSIS Events section.