Chong Shangguan

activity

20232026

collaborators

5 papers

math.CO2026

Extremal problems for cancellative and locally thin hypergraphs

Miao Liu, Chong Shangguan, Chenyang Zhang

We study Turán-type extremal problems for cancellative and locally thin uniform hypergraphs. An $r$ -uniform hypergraph is $t$ -cancellative if $(\cup_{i=1}^t A_i)\cup B\ne (\cup_{i=…

math.CO2024

Asymptotically sharp bounds for cancellative and union-free hypergraphs

Miao Liu, Chong Shangguan, Chenyang Zhang

An $r$ -graph is called $t$ -cancellative if for arbitrary $t + 2$ distinct edges $A_{1}, \dots, A_{t}, B, C$ , it holds that $(\cup_{i = 1}^{t} A_{i}) \cup B \neq = (\cup_{i = 1}^{t} A_{i}) \cup C$ ; it is cal…

cs.IT2024

Near optimal constructions of frameproof codes

Miao Liu, Zengjiao Ma, Chong Shangguan

Frameproof codes are a class of secure codes that were originally introduced in the pioneering work of Boneh and Shaw in the context of digital fingerprinting. They can be used to…

math.CO2024

Approximate generalized Steiner systems and near-optimal constant weight codes

Miao Liu, Chong Shangguan

Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for…

cs.IT2023

When can an expander code correct $Ω (n)$ errors in $O (n)$ time?

Kuan Cheng, Minghui Ouyang, Chong Shangguan +1

Tanner codes are graph-based linear codes whose parity-check matrices can be characterized by a bipartite graph $G$ together with a linear inner code $C_{0}$ . Expander codes are Tann…

Extremal problems for cancellative and locally thin hypergraphs

Asymptotically sharp bounds for cancellative and union-free hypergraphs

Near optimal constructions of frameproof codes

Approximate generalized Steiner systems and near-optimal constant weight codes

When can an expander code correct Ω(n) errors in O(n) time?

When can an expander code correct $Ω (n)$ errors in $O (n)$ time?