Centralized coded caching schemes: A hypergraph theoretical approach C Shangguan, Y Zhang, G Ge
IEEE Transactions on Information Theory 64 (8), 5755-5766, 2018
150 2018 The hat guessing number of graphs N Alon, O Ben-Eliezer, C Shangguan, I Tamo
Journal of Combinatorial Theory, Series B 144, 119-149, 2020
29 2020 New bounds for frameproof codes C Shangguan, X Wang, G Ge, Y Miao
IEEE transactions on information theory 63 (11), 7247-7252, 2017
26 2017 New bounds on the number of tests for disjunct matrices C Shangguan, G Ge
IEEE Transactions on Information Theory 62 (12), 7518-7521, 2016
26 2016 Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius C Shangguan, I Tamo
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
25 2020 Sparse hypergraphs with applications to coding theory C Shangguan, I Tamo
SIAM Journal on Discrete Mathematics 34 (3), 1493-1504, 2020
22 * 2020 Separating hash families: A Johnson-type bound and new constructions C Shangguan, G Ge
SIAM Journal on Discrete Mathematics 30 (4), 2243-2264, 2016
21 2016 Sparse hypergraphs: new bounds and constructions G Ge, C Shangguan
Journal of Combinatorial Theory, Series B 147, 96-132, 2021
17 * 2021 Degenerate Turán densities of sparse hypergraphs C Shangguan, I Tamo
Journal of Combinatorial Theory, Series A 173, 105228, 2020
16 2020 Improved list-decodability and list-recoverability of Reed–Solomon codes via tree packings Z Guo, R Li, C Shangguan, I Tamo, M Wootters
SIAM Journal on Computing 53 (2), 389-430, 2024
15 * 2024 A new piggybacking design for systematic MDS storage codes C Shangguan, G Ge
Designs, Codes and Cryptography 87, 2753-2770, 2019
14 2019 List-decoding and list-recovery of Reed–Solomon codes beyond the Johnson radius for every rate E Goldberg, C Shangguan, I Tamo
IEEE Transactions on Information Theory 69 (4), 2261-2268, 2022
12 * 2022 Singleton-type bounds for list-decoding and list-recovery, and related results E Goldberg, C Shangguan, I Tamo
Journal of Combinatorial Theory, Series A 203, 105835, 2024
11 2024 New bounds and constructions for multiply constant-weight codes X Wang, H Wei, C Shangguan, G Ge
IEEE Transactions on Information Theory 62 (11), 6315-6327, 2016
11 2016 New upper bounds for parent-identifying codes and traceability codes C Shangguan, J Ma, G Ge
Designs, Codes and Cryptography 86, 1727-1737, 2018
7 * 2018 Maximum subsets of G Ge, C Shangguan
Journal of Algebraic Combinatorics 52 (4), 455-460, 2020
6 2020 Degenerate Turán densities of sparse hypergraphs II: a solution to the Brown-Erdős-Sós problem for every uniformity C Shangguan
SIAM Journal on Discrete Mathematics 37 (3), 1920-1929, 2023
5 2023 Some intriguing upper bounds for separating hash families G Ge, C Shangguan, X Wang
Science China Mathematics 62, 269-282, 2019
5 2019 Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius C Shangguan, I Tamo
SIAM Journal on Computing 52 (3), 684-717, 2023
2 2023 New turán exponents for two extremal hypergraph problems C Shangguan, I Tamo
SIAM Journal on Discrete Mathematics 34 (4), 2338-2345, 2020
2 2020 
Gennian GeCapital Normal UniversityBestätigte E-Mail-Adresse bei zju.edu.cn
