This workshop, sponsored by AIM and the NSF, will be devoted to combinatorial coding theory, a field of mathematics that applies discrete structures and algorithms to solve problems in communications. Examples of seminal results in this field include Shannon's noisy channel coding theorem, asymptotically good codes from expander graphs, and capacity achieving spatially-coupled low-density parity-check (LDPC) codes and iterative decoding algorithms. This workshop will aim to build new collaborations in combinatorial coding theory, provide a welcoming environment for new researchers to join the community, develop and strengthen the community of researchers in coding theory, provide mentoring experience to junior faculty, and ignite new lines of research for researchers at all stages.

The main topics for the workshop are

Graph-based codes Quantum error-correction Coding for storage, such as storage in DNA, private information retrieval (PIR), convertible codes, and codes with locality This event will be run as an AIM-style workshop. Participants will be invited to suggest open problems and questions before the workshop begins, and these will be posted on the workshop website. These include specific problems on which there is hope of making some progress during the workshop, as well as more ambitious problems which may influence the future activity of the field. Lectures at the workshop will be focused on familiarizing the participants with the background material leading up to specific problems, and the schedule will include discussion and parallel working sessions.

Space and funding is available for a few more participants. If you would like to participate, please apply by filling out the on-line form no later than November 13, 2025.