Prati
Chong Shangguan(上官冲)
Chong Shangguan(上官冲)
Shandong University
Potvrđena adresa e-pošte na zju.edu.cn - Početna stranica
Naslov
Citirano
Citirano
Godina
Centralized coded caching schemes: A hypergraph theoretical approach
C Shangguan, Y Zhang, G Ge
IEEE Transactions on Information Theory 64 (8), 5755-5766, 2018
1502018
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
282020
New bounds for frameproof codes
C Shangguan, X Wang, G Ge, Y Miao
IEEE Transactions on Information Theory 63 (11), 7247-7252, 2017
262017
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
252020
New bounds on the number of tests for disjunct matrices
C Shangguan, G Ge
IEEE Transactions on Information Theory 62 (12), 7518-7521, 2016
252016
Sparse hypergraphs with applications to coding theory
C Shangguan, I Tamo
SIAM Journal on Discrete Mathematics 34 (3), 1493-1504, 2020
21*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
202016
Sparse hypergraphs: new bounds and constructions
G Ge, C Shangguan
Journal of Combinatorial Theory, Series B 147, 96-132, 2021
17*2021
Improved list-decodability and list-recoverability of Reed-Solomon codes via tree packings
Z Guo, R Li, C Shangguan, I Tamo, M Wootters
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
14*2022
Degenerate Turán densities of sparse hypergraphs
C Shangguan, I Tamo
Journal of Combinatorial Theory, Series A 173, 105228, 2020
142020
A new piggybacking design for systematic MDS storage codes
C Shangguan, G Ge
Designs, Codes and Cryptography 87, 2753-2770, 2019
132019
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
112016
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
102024
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
10*2022
New upper bounds for parent-identifying codes and traceability codes
C Shangguan, J Ma, G Ge
Designs, Codes and Cryptography 86, 1727-1737, 2018
8*2018
Maximum subsets of containing no right angles
G Ge, C Shangguan
Journal of Algebraic Combinatorics 52 (4), 455-460, 2020
62020
Some intriguing upper bounds for separating hash families
G Ge, C Shangguan, X Wang
Science China Mathematics 62, 269-282, 2019
52019
Error detection and correction in communication networks
C Shangguan, I Tamo
2020 IEEE International Symposium on Information Theory (ISIT), 96-101, 2020
22020
New turán exponents for two extremal hypergraph problems
C Shangguan, I Tamo
SIAM Journal on Discrete Mathematics 34 (4), 2338-2345, 2020
22020
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
12023
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20