default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChong Shangguan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j19]Miao Liu, Chong Shangguan
:
Approximate generalized Steiner systems and near-optimal constant weight codes. J. Comb. Theory, Ser. A 209: 105955 (2025)- 2024
- [j18]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
Singleton-type bounds for list-decoding and list-recovery, and related results. J. Comb. Theory A 203: 105835 (2024) - [j17]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): 389-430 (2024) - 2023
- [j16]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) - [j15]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): 1920-1929 (2023) - [j14]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): 2261-2268 (2023) - [j13]Chenyang Zhang, Chong Shangguan, Gennian Ge:
Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes. IEEE Trans. Inf. Theory 69(11): 7099-7109 (2023) - 2021
- [j12]Gennian Ge, Chong Shangguan:
Sparse hypergraphs: New bounds and constructions. J. Comb. Theory B 147: 96-132 (2021) - 2020
- [j11]Chong Shangguan, Itzhak Tamo:
Degenerate Turán densities of sparse hypergraphs. J. Comb. Theory A 173: 105228 (2020) - [j10]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The hat guessing number of graphs. J. Comb. Theory B 144: 119-149 (2020) - [j9]Chong Shangguan, Itzhak Tamo:
Sparse Hypergraphs with Applications to Coding Theory. SIAM J. Discret. Math. 34(3): 1493-1504 (2020) - [j8]Chong Shangguan, Itzhak Tamo:
New Turán Exponents for Two Extremal Hypergraph Problems. SIAM J. Discret. Math. 34(4): 2338-2345 (2020) - 2019
- [j7]Chong Shangguan, Gennian Ge:
A new piggybacking design for systematic MDS storage codes. Des. Codes Cryptogr. 87(12): 2753-2770 (2019) - 2018
- [j6]Chong Shangguan, Jingxue Ma, Gennian Ge:
New upper bounds for parent-identifying codes and traceability codes. Des. Codes Cryptogr. 86(8): 1727-1737 (2018) - [j5]Chong Shangguan, Yiwei Zhang, Gennian Ge:
Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach. IEEE Trans. Inf. Theory 64(8): 5755-5766 (2018) - 2017
- [j4]Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao:
New Bounds for Frameproof Codes. IEEE Trans. Inf. Theory 63(11): 7247-7252 (2017) - 2016
- [j3]Chong Shangguan, Gennian Ge:
Separating Hash Families: A Johnson-type bound and New Constructions. SIAM J. Discret. Math. 30(4): 2243-2264 (2016) - [j2]Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge:
New Bounds and Constructions for Multiply Constant-Weight Codes. IEEE Trans. Inf. Theory 62(11): 6315-6327 (2016) - [j1]Chong Shangguan, Gennian Ge:
New Bounds on the Number of Tests for Disjunct Matrices. IEEE Trans. Inf. Theory 62(12): 7518-7521 (2016)
Conference and Workshop Papers
- 2024
- [c10]Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen:
When Can an Expander Code Correct Ω(n) Errors in O(n) Time? APPROX/RANDOM 2024: 61:1-61:23 - [c9]Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu:
Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up Phenomenon. SoCG 2024: 71:1-71:15 - [c8]Miao Liu, Chong Shangguan:
Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound. ISIT 2024: 139-144 - [c7]Miao Liu, Zengjiao Ma, Chong Shangguan:
Near Optimal Constructions of Frameproof Codes. ISIT 2024: 3154-3159 - 2022
- [c6]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
Singleton-type bounds for list-decoding and list-recovery, and related results. ISIT 2022: 2565-2570 - 2021
- [c5]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: 708-719 - 2020
- [c4]Chong Shangguan, Itzhak Tamo:
Error Detection and Correction in Communication Networks. ISIT 2020: 96-101 - [c3]Chong Shangguan, Itzhak Tamo:
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. STOC 2020: 538-551 - 2019
- [c2]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The Hat Guessing Number of Graphs. ISIT 2019: 490-494 - [c1]Chong Shangguan, Itzhak Tamo:
Universally Sparse Hypergraphs with Applications to Coding Theory. ISIT 2019: 2349-2353
Informal and Other Publications
- 2024
- [i22]Miao Liu, Chong Shangguan:
Approximate generalized Steiner systems and near-optimal constant weight codes. CoRR abs/2401.00733 (2024) - [i21]Miao Liu, Zengjiao Ma, Chong Shangguan:
Near optimal constructions of frameproof codes. CoRR abs/2402.07711 (2024) - [i20]Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge:
Constrained coding upper bounds via Goulden-Jackson cluster theorem. CoRR abs/2407.16449 (2024) - [i19]Xinqi Huang, Chong Shangguan, Xiande Zhang, Yuhao Zhao:
Focal-free uniform hypergraphs and codes. CoRR abs/2410.23611 (2024) - 2023
- [i18]Chenyang Zhang, Chong Shangguan, Gennian Ge:
Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes. CoRR abs/2301.02042 (2023) - [i17]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 abs/2312.16087 (2023) - 2021
- [i16]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate. CoRR abs/2105.14754 (2021) - [i15]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
Singleton-type bounds for list-decoding and list-recovery, and related results. CoRR abs/2112.05592 (2021) - 2020
- [i14]Chong Shangguan, Itzhak Tamo:
Error Detection and Correction in Communication Networks. CoRR abs/2004.01654 (2020) - [i13]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR abs/2011.04453 (2020) - [i12]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i11]Chong Shangguan, Itzhak Tamo:
Universally Sparse Hypergraphs with Applications to Coding Theory. CoRR abs/1902.05903 (2019) - [i10]Chong Shangguan, Itzhak Tamo:
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. CoRR abs/1911.01502 (2019) - 2018
- [i9]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The hat guessing number of graphs. CoRR abs/1812.09752 (2018) - 2017
- [i8]Gennian Ge, Chong Shangguan, Xin Wang:
Some intriguing upper bounds for separating hash families. CoRR abs/1707.01758 (2017) - 2016
- [i7]Chong Shangguan, Gennian Ge:
Separating hash families: A Johnson-type bound and new constructions. CoRR abs/1601.04807 (2016) - [i6]Chong Shangguan, Yiwei Zhang, Gennian Ge:
Centralized coded caching schemes: A hypergraph theoretical approach. CoRR abs/1608.03989 (2016) - [i5]Chong Shangguan, Jingxue Ma, Gennian Ge:
New results for traitor tracing schemes. CoRR abs/1610.07719 (2016) - [i4]Chong Shangguan, Gennian Ge:
A New Piggybacking Design for Systematic MDS Storage Codes. CoRR abs/1610.08223 (2016) - 2015
- [i3]Gennian Ge, Chong Shangguan:
On a Conjecture of Erd{ő}s, Frankl and F{ü}redi. CoRR abs/1501.03566 (2015) - [i2]Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge:
New bounds and constructions for multiply constant-weight codes. CoRR abs/1512.08220 (2015) - 2014
- [i1]Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao:
New Bounds For Frameproof Codes. CoRR abs/1411.5782 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
