Seminars & Colloquia Calendar

Download as iCal file

Discrete Math

Cayley graphs and list-decodable zero-rate codes  

Noga Alon, Princeton and Tel Aviv University

Location:  Hill 705
Date & time: Monday, 26 February 2018 at 2:00PM - 3:00PM

Abstract: What is the maximum possible number of words in a binary code of length n so that there is no Hamming ball of radius (1/4+epsilon)n containing more than two words ?

I will show that the answer is Theta(1/epsilon^{3/2}). A crucial ingredient in the proof is a construction of a family of Cayley graphs which is useful in tackling several additional extremal problems in Graph Theory and Geometry.

Joint work with Bukh and Polyanskiy.

Special Note to All Travelers

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.