Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the intersection of expander graphs and optimally list-decodable codes in this 31-minute conference talk delivered at the ICTS Workshop on HDXs and Codes. Delve into the mathematical foundations connecting high dimensional expanders with error-correcting codes, examining how expander graph properties contribute to optimal list-decodability in coding theory. Learn about the theoretical frameworks that bridge these two fundamental areas of computer science and mathematics, with particular focus on how expansion properties can be leveraged to construct codes with superior decoding capabilities. Understand the role of expander graphs in modern coding theory and their applications to achieving optimal list-decoding performance. Gain insights into recent developments in this active research area that combines combinatorial mathematics, theoretical computer science, and information theory. The presentation forms part of a comprehensive two-week program exploring the convergence of high dimensional expanders and error-correcting codes, featuring contributions from leading researchers in the field.
