Chong Shangguan

Orcid: 0000-0002-3206-3968

According to our database1, Chong Shangguan authored at least 29 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Singleton-type bounds for list-decoding and list-recovery, and related results.
J. Comb. Theory, Ser. A, April, 2024

Near optimal constructions of frameproof codes.
CoRR, 2024

Approximate generalized Steiner systems and near-optimal constant weight codes.
CoRR, 2024

2023
Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, November, 2023

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., September, 2023

Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius.
SIAM J. Comput., June, 2023

List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate.
IEEE Trans. Inf. Theory, April, 2023

Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code.
CoRR, 2023

2021
Sparse hypergraphs: New bounds and constructions.
J. Comb. Theory, Ser. B, 2021

List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate.
CoRR, 2021

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract].
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
New Turán Exponents for Two Extremal Hypergraph Problems.
SIAM J. Discret. Math., 2020

Sparse Hypergraphs with Applications to Coding Theory.
SIAM J. Discret. Math., 2020

The hat guessing number of graphs.
J. Comb. Theory, Ser. B, 2020

Degenerate Turán densities of sparse hypergraphs.
J. Comb. Theory, Ser. A, 2020

Improved List-Decodability of Reed-Solomon Codes via Tree Packings.
Electron. Colloquium Comput. Complex., 2020

Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Error Detection and Correction in Communication Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
A new piggybacking design for systematic MDS storage codes.
Des. Codes Cryptogr., 2019

Universally Sparse Hypergraphs with Applications to Coding Theory.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach.
IEEE Trans. Inf. Theory, 2018

New upper bounds for parent-identifying codes and traceability codes.
Des. Codes Cryptogr., 2018

2017
New Bounds for Frameproof Codes.
IEEE Trans. Inf. Theory, 2017

Some intriguing upper bounds for separating hash families.
CoRR, 2017

2016
New Bounds and Constructions for Multiply Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2016

New Bounds on the Number of Tests for Disjunct Matrices.
IEEE Trans. Inf. Theory, 2016

Separating Hash Families: A Johnson-type bound and New Constructions.
SIAM J. Discret. Math., 2016

New results for traitor tracing schemes.
CoRR, 2016

2015
On a Conjecture of Erd{ő}s, Frankl and F{ü}redi.
CoRR, 2015


  Loading...