Information theory and coding have a subtle stubbornness to them. It doesn’t follow any trends. It doesn’t receive eye-catching magazine covers. However, practically every digital moment of contemporary life depends on it in ways that most people won’t even be aware of. In a way, the five-day workshop in April 2018 at Harvard’s Center of Mathematical Sciences and Applications was a snapshot of that obstinacy; mathematicians, computer scientists, and information theorists came together to try to advance a field that has been pushing itself, largely unseen, for almost eight decades.
That week, if you had entered 20 Garden Street, you would have encountered a group of people who don’t exactly fit the stereotype of mathematicians. Some carried laptops with stickers from a dozen previous conferences and wore tattered jackets. Some arrived straight from the airport, clutching coffee and jet lag, taking notes before the sessions even started. There was less academic spectacle and more of an intense workshop in the traditional sense of the word, with people working together to create something, occasionally arguing loudly, and frequently stopping in the middle of a sentence to redraw a diagram.
| Information | Details |
|---|---|
| Event Name | Workshop on Coding and Information Theory |
| Host Institution | Center of Mathematical Sciences and Applications (CMSA), Harvard University |
| Dates | April 9 – April 13, 2018 |
| Location | 20 Garden Street, Cambridge, Massachusetts |
| Focus Areas | Coding theory, information theory, combinatorics, complexity theory |
| Notable Topics | Polar codes, Reed-Muller codes, DNA memories, distributed storage, zero-error information theory |
| Confirmed Speakers | Emmanuel Abbe (Princeton), Yury Polyanskiy (MIT), David Zuckerman (UT Austin), Olgica Milenkovic (Illinois), among others |
| Participation | Open to all interested researchers, subject to capacity |
| Field Origins | Rooted in Claude Shannon’s foundational work in the 1940s |
| Modern Applications | Wireless networks, satellite communication, cryptography, multimedia compression |
The peculiar territory the field occupies is what makes it fascinating and why this particular gathering is significant. Between engineering reality and pure math lies coding theory. It determines whether your DNA-based storage experiment can recover a corrupted base pair, whether your video call survives a flickering signal, and whether the satellite three hundred miles overhead is returning numbers you can truly trust. Speaking with professionals in the field gives the impression that they are performing the unglamorous plumbing of the information age, and they appear to be generally okay with that.
Leaning heavily into the intersections was the CMSA workshop. The terms “locally testable codes,” “list-decodable codes,” “polar codes,” and “Reed-Muller thresholds” all came up, and despite their names, they all have deeper connections to combinatorics and complexity theory. There was Emmanuel Abbe. So were David Zuckerman, Yury Polyanskiy, and Swastik Kopparty, names that anyone familiar with theoretical computer science or pseudorandomness will instantly recognize. It’s difficult to ignore how frequently the same researchers show up at the frontier, year after year, with slightly different issues and the same insatiable curiosity.
Storage was one topic that kept coming up. Not the cloud type. The more difficult types include coding for distributed systems in which servers malfunction, DNA memories in which biological rather than electrical errors occur, and synchronization issues in which bits are erased rather than flipped. Shannon’s framework still adapts to these issues, which he could not have predicted in 1948. That sounds almost philosophical, but nobody in the room would put it that way.
The sense that this field is far from done persisted after the slides went dark and the chairs were cleared. While investors and tech executives are continuously discussing AI and quantum computing, individuals working in rooms like this one are continuously improving the mathematics that subtly keeps everything else together. It’s unlikely that the general public will ever take notice. They most likely won’t have to. The codes will continue to function, the mistakes will continue to be discovered, and somewhere, probably in a different workshop with many of the same faces, the next quiet breakthrough will already be taking shape.
