SEMINAR:Beyond the Hamming metrics: Applications of ordered structures..

Guest: Mahir Bilen Can, Tulane University

Title: Beyond the Hamming metrics: Applications of ordered structures on coding theory (MATH, CS)

Date/Time: December 18, 2024, 16:40

Location: https://zoom.us/j/98438990666?pwd=bHNlNmVJSG5ZQS9OMnJndGRCSDVidz09, Meeting ID: 984 3899 0666, Passcode: 085177

Abstract: Information theory is rooted in two fundamental principles: redundancy and the distance between codewords. The classical Hamming metric measures the distance between codewords by counting the number of positions where they differ. In recent decades, information theorists have explored the use of ordered structures to gain deeper insights into coding theory. A prominent example is the Niederreiter-Tsfasman-Rozenbloom (NTR) metric, defined on matrices. In this talk, we will discuss our variants of the NTR metric and their applications in the setting of algebraic geometry codes.

Bio: Mahir Bilen Can received his Bachelor of Science degree in Mathematics from Middle East Technical University in 2001 and his Ph.D. in Mathematics from the University of Pennsylvania (USA). Following his postdoctoral fellowship at Western University (Canada), he held various visiting positions at Yale University, University of California San Diego, Indian Institute of Technology-Bombay (India), Okinawa Institute of Science and Technology (Japan), and Nova University (Portugal). Currently, he is a Professor of Mathematics at Tulane University. His research interests include combinatorics, algebraic geometry, representation theory, and (quantum) information theory. He has supervised eight Ph.D. theses and one Master's thesis in these areas.