Generalizations and New Applications of Covering Codes
(The talk will be given in English)
Speaker: Dor Elimelech - School of Electrical and Computer Engineering, Ben Gurion University
011 hall, Electrical Engineering-Kitot Building
Monday, July 22nd, 2024
12:00-13:00
Generalizations and New Applications of Covering Codes
Abstract
The covering problem is a fundamental problem in metric spaces: given a non-negative number $r$, find a set of points in the space (perhaps that is of minimal size), such that the balls of radius $r$ centered at those points cover the entire space. Such sets, often referred to as covering codes, have been thoroughly studied due to their applications to communications and algorithms and their fascinating relations with various topics in pure and applied mathematics. Motivated by new applications to the field of communications, we propose and sqtudy two fairly intuitive generalizations of the notation of covering codes in Hamming spaces and constrained systems.
Short Bio
Dor Elimelech received the first B.Sc. degree in mathematics and the second B.Sc. and M.Sc. (summa cum laude) degrees in electrical engineering from the Ben-Gurion University of the Negev, Israel, in 2018 and 2020, respectively, where he is currently pursuing the Ph.D. degree in electrical engineering. His research interests include coding theory, pure and applied probability, and ergodic theory.
השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום שם מלא + מספר ת.ז. בטופס הנוכחות שיועבר באולם במהלך הסמינר
