Applied mathematics seminar
If you want to suggest a speaker, give a talk, or sign up for the mailing list, please write to firstname.lastname@example.org
- Date: TBA. Place: Högskolan i Skövde. Portalen room P101. Title: TBA. Speaker: David Koloseni, University of Dar es salaam, Tanzania.
- Date: 13 April 2018 10:15-11:30. Place Högskolan i Skövde. Portalen room P101. Title: Coding theory theme part 6: Subspace codes and the Grassmannian. Speaker: Klara Stokes. Abstract: This is part of our study seminar series in coding theory. In this talk I will explain results obtained by some authors (including myself) about the decoding of geometric subspaces codes. Subspace codes are codes in which the code words are subspaces (instead of vectors). Important applications of subspace codes include network coding and authentication codes (A-codes).
Date: 1 March 2018 14:15-15:00. Place: Högskolan i Skövde. Portalen room P201. Title: Coding theory theme part 5: Reed-Solomon and Algebraic Geometry Codes. Speaker: Yohannes Tadesse. Abstract: This is part of the seminar series in mathematics and applications within the theme on Coding Theory. This time we consider Reed-Solomon and Algebraic Geometry Codes. We look at the role mathematics plays in constructing and decoding these codes. No previous knowledge in algebraic geometry is required, but the relevant details from algebraic geometry will be introduced during the talk. Some decoding algorithms will be presented. You all are welcome.
- Date: 7 February 2018 10:15-11:30. Place: Högskolan i Skövde. Portalen room P101. Applied Mathematics Seminar. Coding theory theme, part 4: Post-quantum cryptography with error-correcting codes. Speaker: Stefan Karlsson and Klara Stokes (Högskolan i Skövde). Abstract: In 1994 Shor showed that the integer factorization problem can be solved in polynomial time on a quantum computer. As a consequence, cryptographic public-key protocols relying on the integer factorization or the discrete logarithm problems, like the popular RSA and elliptic curve cryptography, are unsecure against attacks using quantum computers. Post-quantum cryptography is the research area studying cryptographic protocols that remain secure against such attacks. Code-based cryptography has arisen as a strong candidate for post-quantum cryptography. In this talk we explain how code-based cryptography works, we give a short historical background and a short current state-of-the art.
- Date: 18 January 2018 11:00-12:00. Place: Högskolan i Skövde. Portalen room P101. Applied Mathematics Seminar. Coding theory theme, part 3: Self-dual codes. Speaker: Yohannes Tadesse (Högskolan i Skövde). Abstract: This is a continuation of the seminar series on code theory and this time we consider self-dual codes. The focus will mainly be construction/classification of self-dual codes and their relations with algebraic objects like groups and invariant rings. Concrete examples of the Hamming codes and the Golay codes, and some applications will be presented. Slides
- Date: Friday 15 December 11:00-12:00. Place: Högskolan i Skövde. Portalen room P101. Applied Mathematics Seminar. Coding theory theme, part 2: Different types of codes.Speaker: Yohannes Tadesse (Högskolan i Skövde). This is part of the Applied Mathematics Seminar series which deals with Coding theory. The speakers in the previous seminar talked about linear codes and some applications. As a continuation, in this seminar I will talk about some aspects of cyclic codes and Goppa codes and, if time allows, algebraic geometry codes. The talk is aimed at anyone with/out any background in the subject. So everyone is welcome!
- Date: 20 November 13:15- 14:30. Place: Vänern och vättern (Portalen). (Applied Mathematics Seminar) Error-correcting codes and applications (Stefan Karlsson and Klara Stokes from Högskolan i Skövde) In the transmission of information, errors occur. By coding the information before transmission using an error-correcting code, it is possible to correct such errors and to recover the sent information. Error-correcting codes are used in various applications like data storage, data transmission, data compression, and cryptography. This seminar is divided in two parts. The first part is an elementary introduction to linear error-correcting codes, with many simple examples. In the second part we will see examples of how error-correcting codes are used in some applications. SLIDES (PART 2)
Date: TBA. Place: Högskolan i Skövde. Portalen room P101. Title: TBA. Speaker: David Koloseni, University of of Dar es salaam, Tanzania.