Chong Shangguan

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 44

Top Topics

Minimum Distance

Upper And Lower Bounds

Error Detection And Correction

Top Venues

IEEE Trans. Inf. Theory

SIAM J. Discret. Math.

Publications

Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu
Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up Phenomenon. SoCG (2024)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53 (2) (2024)
Miao Liu, Zengjiao Ma, Chong Shangguan
Near optimal constructions of frameproof codes. CoRR (2024)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Singleton-type bounds for list-decoding and list-recovery, and related results. J. Comb. Theory, Ser. A 203 (2024)
Miao Liu, Chong Shangguan
Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound: the odd distances. CoRR (2024)
Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge
Constrained coding upper bounds via Goulden-Jackson cluster theorem. CoRR (2024)
Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen
Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code. CoRR (2023)
Chong Shangguan, Itzhak Tamo
Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius. SIAM J. Comput. 52 (3) (2023)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate. IEEE Trans. Inf. Theory 69 (4) (2023)
Chenyang Zhang, Chong Shangguan, Gennian Ge
Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes. CoRR (2023)
Chong Shangguan
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. 37 (3) (2023)
Chenyang Zhang, Chong Shangguan, Gennian Ge
Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes. IEEE Trans. Inf. Theory 69 (11) (2023)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS (2022)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Singleton-type bounds for list-decoding and list-recovery, and related results. ISIT (2022)
Gennian Ge, Chong Shangguan
Sparse hypergraphs: New bounds and constructions. J. Comb. Theory, Ser. B 147 (2021)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Singleton-type bounds for list-decoding and list-recovery, and related results. CoRR (2021)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS (2021)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate. CoRR (2021)
Chong Shangguan, Itzhak Tamo
Degenerate Turán densities of sparse hypergraphs. J. Comb. Theory, Ser. A 173 (2020)
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
The hat guessing number of graphs. J. Comb. Theory, Ser. B 144 (2020)
Chong Shangguan, Itzhak Tamo
Error Detection and Correction in Communication Networks. CoRR (2020)
Chong Shangguan, Itzhak Tamo
Sparse Hypergraphs with Applications to Coding Theory. SIAM J. Discret. Math. 34 (3) (2020)
Chong Shangguan, Itzhak Tamo
Error Detection and Correction in Communication Networks. ISIT (2020)
Chong Shangguan, Itzhak Tamo
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. STOC (2020)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR (2020)
Chong Shangguan, Itzhak Tamo
New Turán Exponents for Two Extremal Hypergraph Problems. SIAM J. Discret. Math. 34 (4) (2020)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. 27 (2020)
Chong Shangguan, Itzhak Tamo
Universally Sparse Hypergraphs with Applications to Coding Theory. CoRR (2019)
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
The Hat Guessing Number of Graphs. ISIT (2019)
Chong Shangguan, Itzhak Tamo
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. CoRR (2019)
Chong Shangguan, Itzhak Tamo
Universally Sparse Hypergraphs with Applications to Coding Theory. ISIT (2019)
Chong Shangguan, Gennian Ge
A new piggybacking design for systematic MDS storage codes. Des. Codes Cryptogr. 87 (12) (2019)
Chong Shangguan, Yiwei Zhang, Gennian Ge
Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach. IEEE Trans. Inf. Theory 64 (8) (2018)
Chong Shangguan, Jingxue Ma, Gennian Ge
New upper bounds for parent-identifying codes and traceability codes. Des. Codes Cryptogr. 86 (8) (2018)
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
The hat guessing number of graphs. CoRR (2018)
Gennian Ge, Chong Shangguan, Xin Wang
Some intriguing upper bounds for separating hash families. CoRR (2017)
Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao
New Bounds for Frameproof Codes. IEEE Trans. Inf. Theory 63 (11) (2017)
Chong Shangguan, Gennian Ge
Separating hash families: A Johnson-type bound and new constructions. CoRR (2016)
Chong Shangguan, Yiwei Zhang, Gennian Ge
Centralized coded caching schemes: A hypergraph theoretical approach. CoRR (2016)
Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge
New Bounds and Constructions for Multiply Constant-Weight Codes. IEEE Trans. Inf. Theory 62 (11) (2016)
Chong Shangguan, Jingxue Ma, Gennian Ge
New results for traitor tracing schemes. CoRR (2016)
Chong Shangguan, Gennian Ge
New Bounds on the Number of Tests for Disjunct Matrices. IEEE Trans. Inf. Theory 62 (12) (2016)
Chong Shangguan, Gennian Ge
A New Piggybacking Design for Systematic MDS Storage Codes. CoRR (2016)
Chong Shangguan, Gennian Ge
Separating Hash Families: A Johnson-type bound and New Constructions. SIAM J. Discret. Math. 30 (4) (2016)
Gennian Ge, Chong Shangguan
On a Conjecture of Erd{ő}s, Frankl and F{ü}redi. CoRR (2015)
Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge
New bounds and constructions for multiply constant-weight codes. CoRR (2015)
Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao
New Bounds For Frameproof Codes. CoRR (2014)