The following pages link to Chong Shangguan (Q777480):
Displaying 24 items.
- The hat guessing number of graphs (Q777481) (← links)
- New upper bounds for parent-identifying codes and traceability codes (Q1650430) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles (Q2021406) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- A new piggybacking design for systematic MDS storage codes (Q2334436) (← links)
- New Bounds and Constructions for Multiply Constant-Weight Codes (Q2976510) (← links)
- New Bounds for Frameproof Codes (Q4566557) (← links)
- Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach (Q4682874) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- New Turán Exponents for Two Extremal Hypergraph Problems (Q5138977) (← links)
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius (Q5144940) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity (Q6046820) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- List-Decoding and List-Recovery of Reed–Solomon Codes Beyond the Johnson Radius for Every Rate (Q6153667) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
- Singleton-type bounds for list-decoding and list-recovery, and related results (Q6187335) (← links)
- Approximate generalized Steiner systems and near-optimal constant weight codes (Q6515758) (← links)
- Near optimal constructions of frameproof codes (Q6521437) (← links)
- Beyond chromatic threshold via $(p,q)$-theorem, and sharp blow-up phenomenon (Q6527828) (← links)
- Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes (Q6575539) (← links)
- Approximate generalized Steiner systems and near-optimal constant weight codes (Q6637139) (← links)