Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
Yeyuan Chen, Zihan Zhang
To apear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), Prague, Czech Republic, 2025
Currently, I am a Ph.D. student in computer science at The Ohio State University under the guidance of Prof. Zeyu Guo. Prior to this, I obtained my bachelor degree in Mathematics and Applied Mathematics at Sichuan University. Also, I have 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 coding theory, coding for (distributed) storage systems, quantum error correction, pseudorandomness, efficient (list) decoding algorithms, combinatorics, and applications of coding theory into cryptography. However, I am also developing my interests to interdisciplinary areas between machine/deep learning, combinatorics, information theory, coding theory and so on. You can find some of my recent work on my arXiv page :)
In Spring 2024, I was a long-term visitor of Simons program Error-Correcting Codes: Theory and Practice at UC Berkeley.
My current research interests are primarily in coding theory, coding for (distributed) storage systems, quantum error correction, pseudorandomness, efficient (list) decoding algorithms, combinatorics, and applications of coding theory into cryptography. However, I am also developing my interests to interdisciplinary areas between machine/deep learning, combinatorics, information theory, coding theory and so on. You can find some of my recent work on my arXiv page :)
In Spring 2024, I was a long-term visitor of Simons program Error-Correcting Codes: Theory and Practice at UC Berkeley.
Selected Works
Zeyu Guo, Zihan Zhang
In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, USA, 2023