Zihan Zhang
Scholar

Zihan Zhang

Google Scholar ID: soyBFh8AAAAJ
The Ohio State University
Coding theoryPseudorandomnessCombinatorics
Citations & Impact
All-time
Citations
76
 
H-index
5
 
i10-index
3
 
Publications
8
 
Co-authors
8
list available
Publications
8 items
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
  • - Paper 'Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds' to appear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), Prague, Czech Republic, 2025; ACM STOC 2025 Best Student Paper; Invited to SICOMP Special Issue
  • - Paper 'Randomly punctured Reed-Solomon codes achieve the list decoding capacity over polynomial-size alphabets' in Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, USA, 2023
Research Experience
  • - Long-term visitor of Simons program 'Error-Correcting Codes: Theory and Practice' at UC Berkeley in Spring 2024
  • - Research intern at Toyota Technological Institute at Chicago during Summer 2025, under the guidance of Prof. Madhur Tulsiani
Education
  • - Ph.D. candidate in computer science at The Ohio State University, under the guidance of Prof. Zeyu Guo
  • - Bachelor's degree in Mathematics and Applied Mathematics from Sichuan University
  • - One-year background in graduate studies from the School of Electronic Information and Electrical Engineering at Shanghai Jiao Tong University
Background
  • Current research interests are primarily in coding theory, coding for (distributed) storage systems, pseudorandomness, efficient (list) decoding algorithms, combinatorics, and applications of coding theory into cryptography. Also developing interests to interdisciplinary areas between machine/deep learning, combinatorics, information theory, coding theory and so on.
Miscellany
  • Personal interests include photography