On a Conjecture of Erd{ő}s, Frankl and F{ü}redi. - Gennian Ge; Chong Shangguan (CoRR, 2015)

New results for traitor tracing schemes. - Chong Shangguan; Jingxue Ma; Gennian Ge (CoRR, 2016)

Separating Hash Families: A Johnson-type bound and New Constructions. - Chong Shangguan; Gennian Ge (SIAM J. Discret. Math., 2016)

New Bounds on the Number of Tests for Disjunct Matrices. - Chong Shangguan; Gennian Ge (IEEE Trans. Inf. Theory, 2016)

New Bounds and Constructions for Multiply Constant-Weight Codes. - Xin Wang 065; Hengjia Wei; Chong Shangguan; Gennian Ge (IEEE Trans. Inf. Theory, 2016)

Some intriguing upper bounds for separating hash families. - Gennian Ge; Chong Shangguan; Xin Wang 065 (CoRR, 2017)

New Bounds for Frameproof Codes. - Chong Shangguan; Xin Wang 065; Gennian Ge; Ying Miao 001 (IEEE Trans. Inf. Theory, 2017)

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

Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach. - Chong Shangguan; Yiwei Zhang; Gennian Ge (IEEE Trans. Inf. Theory, 2018)

Universally Sparse Hypergraphs with Applications to Coding Theory. - Chong Shangguan; Itzhak Tamo (ISIT, 2019)

A new piggybacking design for systematic MDS storage codes. - Chong Shangguan; Gennian Ge (Des. Codes Cryptogr., 2019)

Error Detection and Correction in Communication Networks. - Chong Shangguan; Itzhak Tamo (ISIT, 2020)

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

Improved List-Decodability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (Electron. Colloquium Comput. Complex., 2020)

Degenerate Turán densities of sparse hypergraphs. - Chong Shangguan; Itzhak Tamo (J. Comb. Theory A, 2020)

The hat guessing number of graphs. - Noga Alon; Omri Ben-Eliezer; Chong Shangguan; Itzhak Tamo (J. Comb. Theory B, 2020)

Sparse Hypergraphs with Applications to Coding Theory. - Chong Shangguan; Itzhak Tamo (SIAM J. Discret. Math., 2020)

New Turán Exponents for Two Extremal Hypergraph Problems. - Chong Shangguan; Itzhak Tamo (SIAM J. Discret. Math., 2020)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (FOCS, 2021)

List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate. - Eitan Goldberg; Chong Shangguan; Itzhak Tamo (CoRR, 2021)

Sparse hypergraphs: New bounds and constructions. - Gennian Ge; Chong Shangguan (J. Comb. Theory B, 2021)

Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code. - Kuan Cheng; Minghui Ouyang; Chong Shangguan; Yuanting Shen (CoRR, 2023)

List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate. - Eitan Goldberg; Chong Shangguan; Itzhak Tamo (IEEE Trans. Inf. Theory, 2023)

Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius. - Chong Shangguan; Itzhak Tamo (SIAM J. Comput., 2023)

Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity. - Chong Shangguan (SIAM J. Discret. Math., 2023)

Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes. - Chenyang Zhang; Chong Shangguan; Gennian Ge (IEEE Trans. Inf. Theory, 2023)

When Can an Expander Code Correct Ω(n) Errors in O(n) Time? - Kuan Cheng; Minghui Ouyang; Chong Shangguan; Yuanting Shen (APPROX/RANDOM, 2024)

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

Near Optimal Constructions of Frameproof Codes. - Miao Liu; Zengjiao Ma; Chong Shangguan (ISIT, 2024)

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

Constrained coding upper bounds via Goulden-Jackson cluster theorem. - Yuanting Shen; Chong Shangguan; Zhicong Lin; Gennian Ge (CoRR, 2024)

Focal-free uniform hypergraphs and codes. - Xinqi Huang; Chong Shangguan; Xiande Zhang; Yuhao Zhao (CoRR, 2024)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (SIAM J. Comput., 2024)

Singleton-type bounds for list-decoding and list-recovery, and related results. - Eitan Goldberg; Chong Shangguan; Itzhak Tamo (J. Comb. Theory A, 2024)

Approximate generalized Steiner systems and near-optimal constant weight codes. - Miao Liu; Chong Shangguan (J. Comb. Theory, Ser. A, 2025)

Near Optimal Probabilistic Constructions of Frameproof Codes. - Miao Liu; Zengjiao Ma; Chong Shangguan (IEEE Trans. Inf. Theory, 2025)