Algebraic geometric codes and their applications

Computer Science/Discrete Mathematics Seminar II
Topic:Algebraic geometric codes and their applications
Speaker:Gil Cohen
Affiliation:Princeton University
Date:Tuesday, September 20
Time/Room:10:30am - 12:30pm/S-101
Video Link:https://video.ias.edu/CSDM/2016/0920-Cohen

In 1975 Goppa suggested a general method for constructing error correcting codes based on algebraic geometry. In a long line of research such codes were constructed, constituting as a precious example of a construction that beats the probabilistic method (namely, the Gilbert-Varshamov bound). In this talk we give a brief introduction to algebraic geometric codes, and present applications to small-bias sets and, if time permits, also to hitting set generators for low degree polynomials. No prior knowledge in algebraic geometry is assumed.