אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

The generalized covering radius (GCR) was recently introduced as a fundamental property of linear codes, shown to characterize a trade-off between storage amount, access complexity, and latency in linear data querying protocols (such as many PIR protocols). In the general case (where the codes are not necessarily linear), the GCR is used in order to formulate a higher-order version of the famous combinatorial football-pool problem. During this talk, we shall discuss the equivalent definitions and basic properties of the GCR and survey the recent progress in the study of generalized covering codes. Dor Elimelech received his B.Sc. in mathematics and his B.Sc. in electrical engineering in 2018 from Ben-Gurion University of the Negev, Israel; his M.Sc. degree in electrical engineering in 2020 from Ben-Gurion University of the Negev (summa cum laude). In 2020 he started his Ph.D. in electrical engineering, also at Ben-Gurion University, supervised by Prof. Moshe Schwartz and Prof. Tom Meyerovitch. His research interests include coding theory, probability, and dynamical systems.