CS
Chong Shangguan
math.COcs.ITmath.ITcs.DMmath.MG
On Valency
published · living versionsW_g8cbdgmh·v1 · currentpublished
A near-quadratic lower bound for the Brown–Erdős–Sós -problem
with Xiangliang Kong, Xin Wang
1 version
Preprints & journals
39 papers in the corpus · 2014–2026Thresholds and spread in set systems of bounded VC-dimension2609.30263v1 · Chong Shangguan2026 · 0 citationsarXiv
Extremal problems for cancellative and locally thin hypergraphs2609.08858v1 · Miao Liu, Chong Shangguan, Chenyang Zhang2026 · 0 citationsarXiv
The Optimal Asymptotic Rate of Generalized Covering Codes2608.24856v2 · Hengzhuo Li, Chong Shangguan, Hengjia Wei2026 · 0 citationsarXiv
Exact Homomorphism Thresholds Beyond Cliques2607.28241v1 · Xinqi Huang, Mingyuan Rong, Chong Shangguan2026 · 0 citationsarXiv
An Erdős Matching Conjecture for Vector Spaces2606.24529v1 · Baoyan Feng, Chong Shangguan, Yulin Yang et al.2026 · 0 citationsarXiv
Balanced Sperner families via the topological Tverberg theorem2606.10885v2 · Chong Shangguan, Zixiang Xu, Yulin Yang2026 · 0 citationsarXiv
Sharp asymptotic bounds for uniform union-free hypergraphs2605.11949v3 · Miao Liu, Chong Shangguan, Chenyang Zhang2026 · 0 citationsarXiv
Improved Rate-versus-Distance Upper Bounds for LDPC Codes2605.01213v3 · Chong Shangguan, Yulin Yang2026 · 0 citationsarXiv
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets2604.13431v2 · Zeyu Guo, Roshan Raj, Chong Shangguan et al.2026 · 0 citationsarXiv
Incidence theorems for multivariate polynomials over finite fields2509.17563v2 · Chong Shangguan, Yulin Yang, Tao Zhang2025 · 0 citationsarXiv
Stability with minuscule structure for chromatic thresholds2506.14748v2 · Jaehoon Kim, Hong Liu, Chong Shangguan et al.2025 · 0 citationsarXiv
Asymptotically sharp bounds for cancellative and union-free hypergraphs2411.07908v1 · Miao Liu, Chong Shangguan, Chenyang Zhang2024 · 0 citationsarXiv
Focal-free uniform hypergraphs and codes2410.23611v1 · Xinqi Huang, Chong Shangguan, Xiande Zhang et al.2024 · 0 citationsarXiv
Constrained coding upper bounds via Goulden-Jackson cluster theorem2407.16449v1 · Yuanting Shen, Chong Shangguan, Zhicong Lin et al.2024 · 0 citationsarXiv
Beyond chromatic threshold via the -theorem, and a sharp blow-up phenomenon2403.17910v3 · Hong Liu, Chong Shangguan, Jozef Skokan et al.2024 · 1 citationarXiv
Near optimal constructions of frameproof codes2402.07711v1 · Miao Liu, Zengjiao Ma, Chong Shangguan2024 · 0 citationsarXiv
Approximate generalized Steiner systems and near-optimal constant weight codes2401.00733v2 · Miao Liu, Chong Shangguan2024 · 3 citationsarXiv
When can an expander code correct errors in time?2312.16087v2 · Kuan Cheng, Minghui Ouyang, Chong Shangguan et al.2023 · 0 citationsarXiv
Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes2301.02042v1 · Chenyang Zhang, Chong Shangguan, Gennian Ge2023 · 1 citationarXiv
Degenerate Turán densities of sparse hypergraphs II: a solution to the Brown-Erdős-Sós problem for every uniformity2210.11338v1 · Chong Shangguan2022 · 4 citationsarXiv
Singleton-type bounds for list-decoding and list-recovery, and related results2112.05592v1 · Eitan Goldberg, Chong Shangguan, Itzhak Tamo2021 · 16 citationsarXiv
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate2105.14754v1 · Eitan Goldberg, Chong Shangguan, Itzhak Tamo2021 · 1 citationarXiv
Improved List-Decodability of Reed--Solomon Codes via Tree Packings2011.04453v2 · Zeyu Guo, Ray Li, Chong Shangguan et al.2020 · 5 citationsarXiv
New Turán exponents for two extremal hypergraph problems2004.03099v2 · Chong Shangguan, Itzhak Tamo2020 · 0 citationsarXiv
Error Detection and Correction in Communication Networks2004.01654v1 · Chong Shangguan, Itzhak Tamo2020 · 1 citationarXiv
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius1911.01502v1 · Chong Shangguan, Itzhak Tamo2019 · 30 citationsarXiv
Degenerate Turán densities of sparse hypergraphs1907.04930v3 · Chong Shangguan, Itzhak Tamo2019 · 0 citationsarXiv
Sparse Hypergraphs with Applications to Coding Theory1902.05903v4 · Chong Shangguan, Itzhak Tamo2019 · 23 citationsarXiv
Some intriguing upper bounds for separating hash families1707.01758v2 · Gennian Ge, Chong Shangguan, Xin Wang2017 · 8 citationsarXiv
Sparse hypergraphs: new bounds and constructions1706.03306v3 · Gennian Ge, Chong Shangguan2017 · 12 citationsarXiv
Maximum subsets of containing no right angles1612.08255v2 · Gennian Ge, Chong Shangguan2016 · 3 citationsarXiv
A New Piggybacking Design for Systematic MDS Storage Codes1610.08223v1 · Chong Shangguan, Gennian Ge2016 · 12 citationsarXiv
New results for traitor tracing schemes1610.07719v1 · Chong Shangguan, Jingxue Ma, Gennian Ge2016 · 2 citationsarXiv
Centralized coded caching schemes: A hypergraph theoretical approach1608.03989v1 · Chong Shangguan, Yiwei Zhang, Gennian Ge2016 · 153 citationsarXiv
Separating hash families: A Johnson-type bound and new constructions1601.04807v2 · Chong Shangguan, Gennian Ge2016 · 23 citationsarXiv
Good traceability codes do exist1601.04810v2 · Gennian Ge, Chong Shangguan2016 · 0 citationsarXiv
New bounds and constructions for multiply constant-weight codes1512.08220v1 · Xin Wang, Hengjia Wei, Chong Shangguan et al.2015 · 11 citationsarXiv
New bounds on the number of tests for disjunct matrices1501.03566v2 · Chong Shangguan, Gennian Ge2015 · 26 citationsarXiv
New Bounds For Frameproof Codes1411.5782v1 · Chong Shangguan, Xin Wang, Gennian Ge et al.2014 · 33 citationsarXiv
Career total: 54 works. 39 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.