Chong Shangguan

activity

20182026

most citedImproved List-Decodability of Reed--Solomon Codes via Tree Packings

4 citations · 8 across the 11 of their papers we have counts for

collaborators

12 papers

math.CO2026

An Erdős Matching Conjecture for Vector Spaces

Baoyan Feng, Chong Shangguan, Yulin Yang +1

We study a vector-space analogue of the Erdős Matching Conjecture. Let $m_{q} (n, k, s)$ denote the maximum cardinality of a family of $k$ -dimensional subspaces of an $n$ -dimensional ve…

math.CO2026

Balanced Sperner families via the topological Tverberg theorem

Chong Shangguan, Zixiang Xu, Yulin Yang

For every prime power $r \geq 2$ , we show that any Sperner family $F \subseteq 2^{[n]}$ with $∣ F ∣ \geq (r - 1) n + 1$ contains $r$ pairwise disjoint nonempty subfamilies wh…

cs.IT2026

Improved Rate-versus-Distance Upper Bounds for LDPC Codes

Chong Shangguan, Yulin Yang

LDPC codes play a vital role in coding theory and practical error correction. A central problem in this direction is to understand their rate--distance tradeoff. In this paper, we…

math.CO2022★ 2 cited

Degenerate Turán densities of sparse hypergraphs II: a solution to the Brown-Erdős-Sós problem for every uniformity

Chong Shangguan

For fixed integers $r \geq 3, e \geq 3$ , and $v \geq r + 1$ , let $f_{r} (n, v, e)$ denote the maximum number of edges in an $n$ -vertex $r$ -uniform hypergraph in which the union of arbitrary $e$ …

cs.IT2021

Singleton-type bounds for list-decoding and list-recovery, and related results

Eitan Goldberg, Chong Shangguan, Itzhak Tamo

List-decoding and list-recovery are important generalizations of unique decoding that received considerable attention over the years. However, the optimal trade-off among list-deco…

cs.IT2020★ 4 cited

Improved List-Decodability of Reed--Solomon Codes via Tree Packings

Zeyu Guo, Ray Li, Chong Shangguan +2

This paper shows that there exist Reed--Solomon (RS) codes, over \black{exponentially} large finite fields \black{in the code length}, that are combinatorially list-decodable well…

cs.IT2020★ 1 cited

Error Detection and Correction in Communication Networks

Chong Shangguan, Itzhak Tamo

Let $G$ be a connected graph on $n$ vertices and $C$ be an $(n, k, d)$ code with $d \geq 2$ , defined on the alphabet set ${0, 1}^{m}$ . Suppose that for $1 \leq i \leq n$ , the $i$ -th vertex…

math.CO2020

New Turán exponents for two extremal hypergraph problems

Chong Shangguan, Itzhak Tamo

An $r$ -uniform hypergraph is called $t$ -cancellative if for any $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…

cs.IT2019★ 1 cited

Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius

Chong Shangguan, Itzhak Tamo

List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions since the work of Guruswami and Sudan. It is now known by the w…

math.CO2019

Degenerate Turán densities of sparse hypergraphs

Chong Shangguan, Itzhak Tamo

For fixed integers $r > k \geq 2, e \geq 3$ , let $f_{r} (n, er - (e - 1) k, e)$ be the maximum number of edges in an $r$ -uniform hypergraph in which the union of any $e$ distinct edges contains at…

math.CO2019

Sparse Hypergraphs with Applications to Coding Theory

Chong Shangguan, Itzhak Tamo

For fixed integers $r \geq 3, e \geq 3, v \geq r + 1$ , an $r$ -uniform hypergraph is called $G_{r} (v, e)$ -free if the union of any $e$ distinct edges contains at least $v + 1$ vertices.…

math.CO2018

The hat guessing number of graphs

Noga Alon, Omri Ben-Eliezer, Chong Shangguan +1

Consider the following hat guessing game: $n$ players are placed on $n$ vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors.…