12 citations · 43 across the 16 of their papers we have counts for
17 papers
Thresholds and spread in set systems of bounded VC-dimension
Chong Shangguan
Let , , and denote the threshold, expectation threshold, and fractional expectation threshold of a family of nonempty…
The Optimal Asymptotic Rate of Generalized Covering Codes
Hengzhuo Li, Chong Shangguan, Hengjia Wei
Let be an alphabet of size . We determine the optimal asymptotic rate of generalized covering codes , whose covering centers in ar…
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
Zeyu Guo, Roshan Raj, Chong Shangguan +1
We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs,…
Constrained coding upper bounds via Goulden-Jackson cluster theorem
Yuanting Shen, Chong Shangguan, Zhicong Lin +1
Motivated by applications in DNA-based data storage, constrained codes have attracted a considerable amount of attention from both academia and industry. We study the maximum cardi…
Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes
Chenyang Zhang, Chong Shangguan, Gennian Ge
Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the additional property that the cyclic shifts of every given codeword are all distinct, where is the code le…
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Understanding the limits of list-decoding and list-recovery of Reed-Solomon (RS) codes is of prime interest in coding theory and has attracted a lot of attention in recent decades.…
Some intriguing upper bounds for separating hash families
Gennian Ge, Chong Shangguan, Xin Wang
An matrix on symbols is called -separating if for arbitrary pairwise disjoint column sets with for $1\le i\le t…
Sparse hypergraphs: new bounds and constructions
Gennian Ge, Chong Shangguan
Let denote the maximum number of edges in an -uniform hypergraph on vertices, in which the union of any distinct edges contains at least vertices. The…
Maximum subsets of containing no right angles
Gennian Ge, Chong Shangguan
Recently, Croot, Lev, and Pach (Ann. of Math., 185:331--337, 2017.) and Ellenberg and Gijswijt (Ann. of Math., 185:339--443, 2017.) developed a new polynomial method and used it to…
A New Piggybacking Design for Systematic MDS Storage Codes
Chong Shangguan, Gennian Ge
Distributed storage codes have important applications in the design of modern storage systems. In a distributed storage system, every storage node has a probability to fail and onc…
New results for traitor tracing schemes
Chong Shangguan, Jingxue Ma, Gennian Ge
In the last two decades, several classes of codes are introduced to protect the copyrighted digital data. They have important applications in the scenarios like digital fingerprint…
Centralized coded caching schemes: A hypergraph theoretical approach
Chong Shangguan, Yiwei Zhang, Gennian Ge
The centralized coded caching scheme is a technique proposed by Maddah-Ali and Niesen as a solution to reduce the network burden in peak times in a wireless system. Later Yan et al…
Good traceability codes do exist
Gennian Ge, Chong Shangguan
Traceability codes are combinatorial objects introduced by Chor, Fiat and Naor in 1994 to be used to trace the origin of digital content in traitor tracing schemes. Let be an a…
Separating hash families: A Johnson-type bound and new constructions
Chong Shangguan, Gennian Ge
Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper,…
New bounds and constructions for multiply constant-weight codes
Xin Wang, Hengjia Wei, Chong Shangguan +1
Multiply constant-weight codes (MCWCs) were introduced recently to improve the reliability of certain physically unclonable function response. In this paper, the bounds of MCWCs an…
New bounds on the number of tests for disjunct matrices
Chong Shangguan, Gennian Ge
Given items with at most of which being positive, instead of testing these items individually, the theory of combinatorial group testing aims to identify all positive items…
New Bounds For Frameproof Codes
Chong Shangguan, Xin Wang, Gennian Ge +1
Frameproof codes are used to fingerprint digital data. It can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for -frameproof…