Chong Shangguan

collaborators

2 papers

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

When can an expander code correct $I^c ◯ (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…

Asymptotically sharp bounds for cancellative and union-free hypergraphs

When can an expander code correct I^c◯(n) errors in O(n) time?

When can an expander code correct $I^c ◯ (n)$ errors in $O (n)$ time?