Organizing Committee
- Hamed Hassani
ETH Zurich - Atri Rudra
University at Buffalo, SUNY - Mary Wootters
Carnegie Mellon University
Abstract
In the theory of error correcting codes, a sender (Alice) wants to send a message to a receiver (Bob), over a noisy channel. Strategies for Alice and Bob have been studied since the works of Shannon and Hamming from the late 1940's, from many different communities. Coding theory is a fundamental solution to challenges that arise in communication, storage, cryptography, and others; as the world changes, our challenges in these areas change, and the scenario changes for Alice and Bob. Fueled by these new scenarios, coding theory remains a rapidly advancing area of research.
One trend in many of these new scenarios in coding theory is the need for algorithmic solutions. For many problems in coding theory, it is possible to come up with nearly optimal solutions (information-theoretically speaking) which are likely very hard for Alice and Bob to actually implement. The goal of algorithmic coding theory is to design solutions which are not only combinatorially good, but are also computationally efficient.
The goal of this workshop is to bring together researchers from several different communities -- applied math, theoretical computer science, communications and electrical engineering -- to focus on a few quickly-moving topics in algorithmic coding theory. Topics will include:
- polar codes,
- codes for interactive communication,
- local decoding and coding for distributed storage, and
- non-malleable codes.
Confirmed Speakers & Participants
Talks will be presented virtually or in-person as indicated in the schedule below.
- Speaker
- Poster Presenter
- Attendee
- Virtual Attendee
-
Ramy Ali
Penn State University
-
Erdal Arikan
Bilkent University
-
Hridam Basu
Northeastern University
-
Jessalyn Bolkema
University of Nebraska-Lincoln
-
Klim Efremenko
Tel-Aviv University
-
Venkata Gandikota
Purdue University
-
Ran Gelles
Princeton University
-
Dina Goldin
Tel Aviv University
-
Elena Grigorescu
Purdue University
-
Venkat Guruswami
Carnegie Mellon University
-
Hamed Hassani
ETH Zurich
-
Anoosheh Heidarzadeh
Texas A&M University
-
Brett Hemenway
University of Pennsylvania
-
Sidharth Jaggi
Chinese University of Hong Kong (CUHK)
-
Swanand Kadhe
Texas A&M University
-
Yael Kalai
Microsoft
-
Swastik Kopparty
Rutgers University
-
Biswaroop Maiti
Northeastern University
-
Sai Vikneshwar Mani Jayaraman
University at Buffalo
-
Carolyn Mayer
University of Nebraska - Lincoln
-
Marco Mondelli
Ecole Polytechnique Federale de Lausanne (EPFL)
-
Hieu Nguyen
Rowan University
-
Joseph Renes
ETH Zurich
-
Noga Ron-Zewi
IAS
-
Atri Rudra
University at Buffalo, SUNY
-
Shubhangi Saraf
Rutgers University
-
Madhu Sudan
Harvard University
-
Rüdiger Urbanke
Ecole Polytechnique Federale de Lausanne (EPFL)
-
Carol Wang
National University of Singapore
-
Daniel Wichs
Northeastern University
-
Mary Wootters
Carnegie Mellon University
-
Sergey Yekhanin
Microsoft Research Redmond
-
Samson Zhou
Purdue University
-
David Zuckerman
University of Texas at Austin