Institute of Mathematics


Modul:   MAT076  Arbeitsgemeinschaft in Codierungstheorie und Kryptographie

Constructions of Rank Metric Convolutional Codes for Random Linear Network Coding (Master's Thesis Defense)

Talk by Kilian Fabian Werder

Date: 01.12.21  Time: 15.00 - 16.00  Room: Y27H25

(**This eSeminar will take place in hybrid mode. The in-person venue is Y27 H25, University of Zurich. You can also follow the talk on Zoom using the same meeting details as previous seminars. If you do not have meeting details, please contact **)

Physical channels like the internet are highly used in the modern world. The impact of the corona pandemic and the current age of digitisation even increased this usage in the last two years. This high usage ultimately leads to transmission bottlenecks and longer waiting times. Random linear network coding is a network protocol which enables an increase in data throughput compared to the widely used broadcasting protocol. The key feature of random linear network coding is the construction of linear combinations during the transmission. Within the proposed network protocol, rank metric codes are applied to improve the error handling and decoding capability. In this context, the selection of the code is crucial and depends on the chosen use case, the network model, and the desired properties of the protocol. For this purpose, several code constructions have been published and can be compared to each other.