About Me
I am an undergraduate in Computer Science at the University of Science and Technology of China (USTC), School of the Gifted Young, advised by Prof. Xue Chen. My work covers theoretical computer science, focusing on coding theory, randomized algorithms, and graph theory. I also compete in competitive programming contests and achieved 13th place at the ICPC 2024 World Finals.
Publications
- Xue Chen, Wenxuan Shu and Zhaienhe Zhou. Algorithms for Sparse LPN and LSPN Against Low‑Noise. 38th Annual Conference on Learning Theory (COLT 2025), to appear. arXiv:2407.19215
- Zhaienhe Zhou and Zeyu Guo. Improved Decoding of Tanner Codes. IEEE International Symposium on Information Theory (ISIT 2025), to appear. arXiv:2501.12293
Selected Awards & Honors
Competition
- ICPC World Finals 2024: 13th place (Highest Honor, top 1%)
- ICPC Asia‑East Continent Final 2024: 5th place; Gold medals ×3 (2022 – 2024)
- Gold medals ×6, ICPC Regionals (2022 – 2024)
- ICPC Nanjing Regional 2024: 2nd place (runner‑up)
- CCPC Haerbin Regional 2024: 2nd place (runner‑up)
- Bronze Medal, National Olympiad in Informatics 2021
Academic
- Silver Scholarship, USTC School of the Gifted Young (2023, 2024)
- Second Prize, National College Student Mathematics Competition 2023
Research Experience
Improved Decoding of Tanner Codes (Summer 2024)
Research Assistant, advised by Zeyu Guo (Ohio State University)
- Developed improved decoding algorithm via weighted voting
- Extended decoding regime from δ d₀ > 3 to δ d₀ > 2
- Derived tighter upper bounds for Tanner code distance using size‑expansion trade‑offs
Algorithms for Sparse LPN/LSPN (February 2024 – present)
Research Assistant, advised by Xue Chen (USTC)
- Proposed LSPN algorithm with time complexity O(η·n/k)^k
- Developed sparse LPN algorithm with subexponential complexity
- Combined domain reduction techniques with Gaussian elimination and BKW
Teaching & Service
- Teaching Assistant, Foundations of Algorithms, USTC (Spring 2024)
- Competition Coach, TopsCoding Winter Course 2024
Last updated: May 5, 2025