Chong Shangguan

55 papers A* 3A 1B 6Journal 45

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Focal-free uniform hypergraphs and codes. J. Comb. Theory, Ser. A Xinqi Huang, Chong Shangguan, Xiande Zhang, Yuhao Zhao
2025	J	`jnl`	Approximate generalized Steiner systems and near-optimal constant weight codes. J. Comb. Theory, Ser. A Miao Liu, Chong Shangguan
2025	J	`jnl`	Constrained Coding Bounds via Goulden-Jackson Cluster Theorem. IEEE Trans. Inf. Theory Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge
2025	J	`jnl`	Near Optimal Probabilistic Constructions of Frameproof Codes. IEEE Trans. Inf. Theory Miao Liu, Zengjiao Ma, Chong Shangguan
2025	J	`jnl`	When Can an Expander Code Correct Ω(n) Errors in O(n) Time? IEEE Trans. Inf. Theory Yuanting Shen, Chong Shangguan, Minghui Ouyang, Kuan Cheng
2024	J	`jnl`	Approximate generalized Steiner systems and near-optimal constant weight codes. CoRR Miao Liu, Chong Shangguan
2024	A*	`conf`	Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up Phenomenon. SoCG Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu
2024	J	`jnl`	Constrained coding upper bounds via Goulden-Jackson cluster theorem. CoRR Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge
2024	J	`jnl`	Focal-free uniform hypergraphs and codes. CoRR Xinqi Huang, Chong Shangguan, Xiande Zhang, Yuhao Zhao
2024	J	`jnl`	Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2024	B	`conf`	Near Optimal Constructions of Frameproof Codes. ISIT Miao Liu, Zengjiao Ma, Chong Shangguan
2024	J	`jnl`	Near optimal constructions of frameproof codes. CoRR Miao Liu, Zengjiao Ma, Chong Shangguan
2024	B	`conf`	Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound. ISIT Miao Liu, Chong Shangguan
2024	J	`jnl`	Singleton-type bounds for list-decoding and list-recovery, and related results. J. Comb. Theory A Eitan Goldberg, Chong Shangguan, Itzhak Tamo
2024	A	`conf`	When Can an Expander Code Correct Ω(n) Errors in O(n) Time? APPROX/RANDOM Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen
2023	J	`jnl`	Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity. SIAM J. Discret. Math. Chong Shangguan
2023	J	`jnl`	Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius. SIAM J. Comput. Chong Shangguan, Itzhak Tamo
2023	J	`jnl`	Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes. IEEE Trans. Inf. Theory Chenyang Zhang, Chong Shangguan, Gennian Ge
2023	J	`jnl`	Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes. CoRR Chenyang Zhang, Chong Shangguan, Gennian Ge
2023	J	`jnl`	Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code. CoRR Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen
2023	J	`jnl`	List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate. IEEE Trans. Inf. Theory Eitan Goldberg, Chong Shangguan, Itzhak Tamo
2022	B	`conf`	Singleton-type bounds for list-decoding and list-recovery, and related results. ISIT Eitan Goldberg, Chong Shangguan, Itzhak Tamo
2021	A*	`conf`	Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2021	J	`jnl`	List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate. CoRR Eitan Goldberg, Chong Shangguan, Itzhak Tamo
2021	J	`jnl`	Singleton-type bounds for list-decoding and list-recovery, and related results. CoRR Eitan Goldberg, Chong Shangguan, Itzhak Tamo
2021	J	`jnl`	Sparse hypergraphs: New bounds and constructions. J. Comb. Theory B Gennian Ge, Chong Shangguan
2020	A*	`conf`	Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. STOC Chong Shangguan, Itzhak Tamo
2020	J	`jnl`	Degenerate Turán densities of sparse hypergraphs. J. Comb. Theory A Chong Shangguan, Itzhak Tamo
2020	B	`conf`	Error Detection and Correction in Communication Networks. ISIT Chong Shangguan, Itzhak Tamo
2020	J	`jnl`	Error Detection and Correction in Communication Networks. CoRR Chong Shangguan, Itzhak Tamo
2020	J	`jnl`	Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2020	J	`jnl`	Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2020	J	`jnl`	New Turán Exponents for Two Extremal Hypergraph Problems. SIAM J. Discret. Math. Chong Shangguan, Itzhak Tamo
2020	J	`jnl`	Sparse Hypergraphs with Applications to Coding Theory. SIAM J. Discret. Math. Chong Shangguan, Itzhak Tamo
2020	J	`jnl`	The hat guessing number of graphs. J. Comb. Theory B Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
2019	J	`jnl`	A new piggybacking design for systematic MDS storage codes. Des. Codes Cryptogr. Chong Shangguan, Gennian Ge
2019	J	`jnl`	Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. CoRR Chong Shangguan, Itzhak Tamo
2019	B	`conf`	The Hat Guessing Number of Graphs. ISIT Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
2019	B	`conf`	Universally Sparse Hypergraphs with Applications to Coding Theory. ISIT Chong Shangguan, Itzhak Tamo
2019	J	`jnl`	Universally Sparse Hypergraphs with Applications to Coding Theory. CoRR Chong Shangguan, Itzhak Tamo
2018	J	`jnl`	Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach. IEEE Trans. Inf. Theory Chong Shangguan, Yiwei Zhang, Gennian Ge
2018	J	`jnl`	New upper bounds for parent-identifying codes and traceability codes. Des. Codes Cryptogr. Chong Shangguan, Jingxue Ma, Gennian Ge
2018	J	`jnl`	The hat guessing number of graphs. CoRR Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
2017	J	`jnl`	New Bounds for Frameproof Codes. IEEE Trans. Inf. Theory Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao
2017	J	`jnl`	Some intriguing upper bounds for separating hash families. CoRR Gennian Ge, Chong Shangguan, Xin Wang
2016	J	`jnl`	A New Piggybacking Design for Systematic MDS Storage Codes. CoRR Chong Shangguan, Gennian Ge
2016	J	`jnl`	Centralized coded caching schemes: A hypergraph theoretical approach. CoRR Chong Shangguan, Yiwei Zhang, Gennian Ge
2016	J	`jnl`	New Bounds and Constructions for Multiply Constant-Weight Codes. IEEE Trans. Inf. Theory Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge
2016	J	`jnl`	New Bounds on the Number of Tests for Disjunct Matrices. IEEE Trans. Inf. Theory Chong Shangguan, Gennian Ge
2016	J	`jnl`	New results for traitor tracing schemes. CoRR Chong Shangguan, Jingxue Ma, Gennian Ge
2016	J	`jnl`	Separating Hash Families: A Johnson-type bound and New Constructions. SIAM J. Discret. Math. Chong Shangguan, Gennian Ge
2016	J	`jnl`	Separating hash families: A Johnson-type bound and new constructions. CoRR Chong Shangguan, Gennian Ge
2015	J	`jnl`	New bounds and constructions for multiply constant-weight codes. CoRR Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge
2015	J	`jnl`	On a Conjecture of Erd{ő}s, Frankl and F{ü}redi. CoRR Gennian Ge, Chong Shangguan
2014	J	`jnl`	New Bounds For Frameproof Codes. CoRR Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao