Event Based Systems in Iași

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

1. Motivating examples: the “Butterfly network”. Routing versus coding.
2. Definition of network and mincut between two vertices. Examples.
3. The min-cut bound (idea of the proof).
4. The “Max-Flow-Min-Cut” theorem (with proof).
5. Subspace codes and subspace error correction.

Read a detailed description of the lectures contents and references.

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

1. Practical Network Coding
2. Security Requirements for Network Coding
3. Excursus: Cryptography
4. Network Coding Schemes Providing Confidentiality
5. Detection of Pollution Attacks

Consult the description of the lectures contents and references.

Back to EBSIS Events section.