I am a Research Fellow in the Pseudorandomness and High-Dimensional Expansion program of the Simons Institute for the Theory of Computing at the University of California, Berkeley during Fall 2026. I will then join the Computer Science and Discrete Math group at the Institute for Advanced Study in Princeton as a Member.

I received my Ph.D. in computer science at The Ohio State University, where I was advised by  Prof. Zeyu Guo. Prior to this, I obtained my bachelor degree in Mathematics and Applied Mathematics at Sichuan University. Also, I had a one-year background in graduate studies from the School of Electronic Information and Electrical Engineering at Shanghai Jiao Tong University.

My current research interests are primarily in theoretical computer science with a focus on coding theory, combinatorics, pseudorandomness, and applications of coding theory into cryptography. You can find some of my recent work on my arXiv page, google scholar as well as the DBLP link.

My research on list decoding and list recovery was featured in Polynomial Times, the annual magazine of the Simons Institute for the Theory of Computing. A comprehensive survey on list decoding by Kumar and Ron-Zewi is available here.

In Spring 2024, I was a long-term visitor of Simons program Error-Correcting Codes: Theory and Practice  at UC Berkeley. I was also a research intern at Toyota Technological Institute at Chicago under the guidance of Prof. Madhur Tulsiani during Summer 2025.