Structure in information theory: Codes, sequences, and graphs


Jacobs Hall, Room 2512, Jacobs School of Engineering, 9500 Gilman Dr, La Jolla, San Diego, California 92093

Sponsored By:
Prof. Young-Han Kim

Lele Wang
Electrical Engineering
Stanford University
Lele Wang


In this talk, I present three distinct problems in information theory, in which embedding appropriate structures plays a key role in finding optimal solutions. First, I propose a universal polarization technique, which alleviates the limitation of Arikan's channel-specific polar code design. Next, I describe how to design binary sequences such that the location of any length-$k$ chunk in the sequence can be uniquely determined via a noisy observation of the chunk. Such sequences can be used for phase detection in positioning systems. After that, I introduce a notion called graph information ratio, which unifies Shannon capacity of a graph and fractional chromatic number. A distance measure can be defined via graph information ratio, which characterizes the similarity between graphs. Finally, I conclude by briefly discussing future research directions in emerging data science applications through the lens of structure and complexity.

Speaker Bio:
Lele Wang is a postdoctoral researcher in Electrical Engineering at Stanford University. She spent one year at Tel Aviv University before joining Stanford, also as a postdoctoral researcher. She received the Ph.D. degree in Communication Theory and Systems at the University of California, San Diego. Her research interests include information theory, coding theory, communication theory, graph theory, and combinatorics. She is a recipient of the 2013 UCSD Shannon Memorial Fellowship, the 2013-2014 Qualcomm Innovation Fellowship, and the 2017 NSF Center for Science of Information (CSoI) Postdoctoral Fellowship. Her Ph.D. thesis "Channel coding techniques for network communication" won the 2017 IEEE Information Theory Society Thomas M. Cover Dissertation Award.

Cheryle Wills (