PAPERS in REFEREED JOURNALS/BOOK CHAPTERS

Journal papers:

1.Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge, New bounds and constructions for multiply constant weight codes, IEEE Trans. Inform. Theory 62 (11), 6315-6327, 2016.

2.Chong Shangguan, Gennian Ge, Separating hash families: A Johnson-type bound and new constructions, SIAM J. Discrete Math. 30 (4), 2243-2264, 2016.

3.Chong Shangguan, Gennian Ge, New bounds on the number of tests for disjunct matrices, IEEE Trans. Inform. Theory 62 (12), 7518-7521, 2016.

4.Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao, New bounds for frameproof codes, IEEE Trans. Inform. Theory 63 (11), 7247-7252, 2017.

5.Chong Shangguan, Jingxue Ma, Gennian Ge, New upper bounds for parent-identifying codes and traceability codes, Des. Codes Cryptogr. 86 (8), 1727-1737, 2018.

6.Chong Shangguan, Yiwei Zhang, Gennian Ge, Centralized coded caching schemes: A hypergraphtheoretical approach, IEEE Trans. Inform. Theory 64 (8), 5755-5766, 2018.

7.Gennian Ge, Chong Shangguan, Xin Wang, Some intriguing upper bounds for separating hash families, Sci. China Math., 62 (2), 269-282, 2019.

8.Chong Shangguan, Gennian Ge, A new piggybacking design for systematic MDS storage codes, Des. Codes Cryptogr. 87, 2753-2770, 2019.

9.Chong Shangguan, Itzhak Tamo, Degenerate Turán densities of sparse hypergraphs, J. Combin. Theory Ser. A, 105228, 25pp, 2020.

10.Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, J. Combin. Theory Ser. B (144), 119-149, 2020.

11.Chong Shangguan, Itzhak Tamo, Sparse hypergraphs with applications to coding theory, SIAM J. Discrete Math., 34 (3), 1493-1504, 2020.

12.Gennian Ge, Chong Shangguan, Maximum subsets of F^n_q containing no right angles, J. Algebraic Combin. (52), 455-460, 2020.

13.Chong Shangguan, Itzhak Tamo, New Tur\'an exponents for two extremal hypergraph problems, SIAM J. Discrete Math., 34 (4), 2338-2345, 2020.

14.Gennian Ge, Chong Shangguan, Sparse hypergraphs: new bounds and constructions, J. Combin. Theory Ser. B, (147) 96-132, 2021.

15.Eitan Goldberg, C. Shangguan, Itzhak Tamo, List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for every rate, IEEE Trans. Inform. Theory, 69 (4), 2261-2268, 2023.

16.Chong Shangguan, Gennian Ge, Sparse hypergraphs: from theory to applications, SCIENTIA SINICA Mathematica 53 (2), 187-216, 2023.

17.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.

18.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.

19.Chenyang Zhang, Chong Shangguan, Gennian Ge, Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes, IEEE Trans. Inform. Theory 69, no. 11, 7099-7109, 2023.

20.Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters, Improved list-decoding of Reed-Solomon codes via tree packings, SIAM J. Comput. 53 (2024), no. 2, 389-430.

21.Eitan Goldberg, Chong Shangguan, Itzhak Tamo, Singleton-type bounds for list-decoding and list-recovery, and related results, J. Combin. Theory Ser. A 203 (2024), Paper No. 105835, 26 pp.

22.Miao Liu, Chong Shangguan, Approximate generalized Steiner systems and near-optimal constant weight codes, J. Combin. Theory Ser. A  209 (2025), Paper No. 105955, 19 pp.

23.Miao Liu, Zengjiao Ma, Chong Shangguan, Near optimal probabilistic constructions of frameproof codes, IEEE Trans. Inform. Theory 71 (2025), no. 6, 4137-4144.

24.Yuanting Shen, Chong Shangguan, Minghui Ouyang, Kuan Cheng, When can an expander code correct $\Omega(n)$ errors in $O(n)$ time? IEEE Trans. Inform. Theory 71 (2025), no. 10, 7626-7643.

25.Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge, Constrained coding bounds via Goulden-Jackson cluster theorem, IEEE Trans. Inform. Theory 71 (2025), no. 12, 9359–9374.

26.Jaehoon Kim, Hong Liu, Chong Shangguan, Guanghui Wang, Zhuo Wu, Yisai Xue, Stability with minuscule structure for chromatic thresholds, Peking Math. J., to appear.

27.Xinqi Huang, Chong Shangguan, Xiande Zhang, Yuhao Zhao, Focal-free uniform hypergraphs and codes, J. Combin. Theory Ser. A  223 (2026), Paper No. 106193.

Conference papers:

1.Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, ISIT2019

2.Chong Shangguan, Itzhak Tamo, Universally Sparse Hypergraphs with Applications to Coding Theory, ISIT 2019

3.Chong Shangguan, Itzhak Tamo, Error detection and error correction in communication graphs, ISIT 2020

4.Chong Shangguan, Itzhak Tamo, Combinatorial list decoding of Reed-Solomon codes beyond the Johnson radius, STOC 2020

5.Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters, Improved list-decoding of Reed-Solomon codes via tree packings, FOCS 2021

6.Eitan Goldberg, Chong Shangguan, Itzhak Tamo, Singleton-type bounds for list-decoding and list-recovery, and related results, ISIT 2022

7.Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu. Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon, SoCG 2024

8.Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen, When can an expander code correct $\Omega(n)$ errors in $O(n)$ time?, RANDOM 2024

9.Miao Liu, Chong Shangguan, Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound, ISIT 2024

10.Miao Liu, Zengjiao Ma, Chong Shangguan, Near Optimal Constructions of Frameproof Codes, ISIT 2024