Storage Codes from Projective Planes
Organizers
Speaker
Junming Ke
Time
Tuesday, January 9, 2024 2:00 PM - 3:00 PM
Venue
A3-2a-302
Abstract
Coding theory has been widely applied in fields such as digital communication, multimedia, and distributed storage systems. In this talk, we will use projective planes to construct the generator and parity-check matrix for storage codes. We will study repair performance and update performance of codes. Private Information Retrieval (PIR) is an important application of coding theory in terms of privacy protection. It allows users to retrieve the required information from the database without compromising the query content. In this talk, I will introduce how to use a generator matrix to construct a private information retrieval scheme. Besides, I will give a toy example to show the relation between coding theory and cryptography protocols.
Speaker Intro
Junming Ke, with a master's degree from Shandong University, has worked at Zhejiang University, Singapore University of Technology and Design, and Huawei. Currently, he is pursuing a Ph.D. in Mathematics and serves as a junior researcher at the University of Tartu, Estonia. He has received the Estonian National Scholarship and XRP Annual Scholarship 2022 at the University of Tartu. He has published more than 20 papers in conferences and journals such as NDSS, ISIT, and ACSAC. He is now the Chair of the IEEE Student Branch at the University of Tartu, and a steering committee member of Baltic Electronics Conferences 2024.