"Error-Correcting Codes: The Mathematics of Communication"
featuring Nathan Kaplan
Wednesday, July 13 at 7:00 pm ET (New York)
Suppose we are trying to communicate over a "noisy channel." There is some probability that the information I send is not the information you receive. We could communicate more reliably by agreeing to repeat the intended message multiple times, but there is a cost to this repetition. A major goal in the theory of error-correcting codes is to understand how to efficiently build redundancy into messages so that we can identify and correct errors. Join mathematician Nathan Kaplan as he introduces us to the ideas that go into the mathematics of communication and shares several neat examples of problems we can solve using ideas from coding theory, including "Hat Problems," "Twenty Questions with Lies," and strategies for gambling on soccer matches in Finland.
Special introduction by Tony Fisher, Principal, Hunter College High School.
This is a live-streamed broadcast of an in-person event. Occasional video recordings are made available for a fee at videos.momath.org.
This page is for the 7:00 pm ET (New York) live-streamed session. Click here to register for an in-person session or for the 4:00 pm ET (New York) session instead.