研究领域：组合数学与信息科学交叉领域的研究，在极值组合学、理论计算机科学、编码理论、图
论及其应用等领域的多个重要问题上做出一系列贡献
theoreming@163.com
分别于2012年6月、2017年6月获得浙江大学数学学院理学学士、博士学位，博士导师为葛根年教授。
毕业后于2017年8月至2020年7月在以色列特拉维夫大学从事博士后研究工作，合作导师为 Itzhak Tamo。2020年9月加入山东大学，任齐鲁青年学者（第一层次），2022年1月起任山东大学杰出中青年学者（第一层次）。
获国际组合数学及应用协会（Institute of Combinatorics）2020年度 Kirkman 奖（该奖项自1994年起颁发，授予博士毕业未满四年的杰出青年学者，每年不超过两位获奖人，本人是2020年唯一获奖人）。入选2021年度国家高层次青年人才项目。
1. Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge, New bounds and constructions for multiplyconstant-weight codes, IEEE Transactions on Information Theory 62 (11), 6315-6327, 2016.
2. Chong Shangguan, Gennian Ge, New bounds on the number of tests for disjunct matrices, IEEE Transactions on Information Theory 62 (12), 7518-7521, 2016.
3. Chong Shangguan, Gennian Ge, Separating hash families: A Johnson-type bound and new construc-tions, SIAM Journal on Discrete Mathematics 30 (4), 2243-2264, 2016.
4. Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao, New bounds for frameproof codes, IEEE Transactions on Information Theory 63 (11), 7247-7252, 2017.
5. Chong Shangguan, Jingxue Ma, Gennian Ge, New upper bounds for parent-identifying codes and traceability codes, Designs, Codes and Cryptography 86 (8), 1727-1737, 2018.
6. Chong Shangguan, Yiwei Zhang, Gennian Ge, Centralized coded caching schemes: A hypergraphtheoretical approach, IEEE Transactions on Information Theory 64 (8), 5755-5766, 2018.
7. Gennian Ge, Chong Shangguan, Xin Wang, Some intriguing upper bounds for separating hash families, Science China Mathematics, 62 (2), 269-282, 2019.
8. Chong Shangguan, Gennian Ge, A new piggybacking design for systematic MDS storage codes, Designs, Codes and Cryptography 87, 2753-2770, 2019.
9. Gennian Ge, Chong Shangguan, Maximum subsets of F^n_q containing no right angles, Journal of Algebraic Combinatorics (52), 455-460, 2020.
10. Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, Journal of Combinatorial Theory, Series B (144), 119-149, 2020.
11. Chong Shangguan, Itzhak Tamo, Degenerate Turán densities of sparse hypergraphs, Journal of Combinatorial Theory, Series A, 105228, 2021.
12. Chong Shangguan, Itzhak Tamo, Combinatorial list decoding of Reed-Solomon codes beyond the Johnson radius, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020), 538-551, 2020.
13. Chong Shangguan, Itzhak Tamo, Sparse hypergraphs with applications to coding theory, SIAM Journal on Discrete Mathematics, 34 (3), 1493-1504, 2020.
14. Chong Shangguan, Itzhak Tamo, Error detection and error correction in communication graphs, 2020 IEEE International Symposium on Information Theory (ISIT2020), available online.
15. Chong Shangguan, Itzhak Tamo, New Tur\'an exponents for two extremal hypergraph problems, SIAM Journal on Discrete Mathematics, 34 (4), 2338-2345, 2020.
16. Gennian Ge, Chong Shangguan, Sparse hypergraphs: new bounds and constructions, Journal of Combinatorial Theory, Series B, (147) 96-132, 2021.
17. Eitan Goldberg, Chong Shangguan, Itzhak Tamo, Singleton-type bounds for list-decoding and list-recovery, and related results, 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland, 2022, pp. 2565-2570.
18. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters, Improved list-decoding of Reed-Solomon codes via tree packings, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS’21), 708-719, IEEE Computer Soc., Los Alamitos, CA, 2022.
19. Eitan Goldberg, Chong Shangguan, Itzhak Tamo, List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate, IEEE Transactions on Information Theory, 69 (4), 2261–2268, 2023.
20. Chong Shangguan, Gennian Ge, Sparse hypergraphs: from theory to applications, SCIENTIA SINICA Mathematica 53 (2), 187-216, 2023.
21. Chong Shangguan, Itzhak Tamo, Generalized singleton bound and list-decoding Reed-Solomon codes beyond the Johnson radius. SIAM J. Comput. 52 (3), 684–717, 2023.
22. Chong Shangguan, Degenerate Tur\'an densities of sparse hypergraphs II: a solution to Brown-Erd\H{o}s-S\'os problem for every uniformity, SIAM J. Discrete Math. 37 (3), 1920–1929, 2023.
23. Chenyang Zhang, Chong Shangguan, Gennian Ge, Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes, IEEE Trans. Inform. Theory, doi: 10.1109/TIT.2023.3296963, available online.
[1]信息驱动的若干离散构型,2022-09-09,2027-12-31,
[2]2022-上官冲-国家优青（海外）,2022-01-01,2027-12-31,
[3]（包干项目）稀疏超图的组合构造,2021-10-12,2024-12-31,
[4]通信与存储编码领域若干关键问题的数学理论和算法子课题,2021-12-01,2026-11-30,
[5]（包干项目）稀疏超图的构造与应用,2021-12-23,2024-12-31,
[6]稀疏超图的组合构造,2021-08-18,2024-12-31,
