Chong Shangguan

collaborators

3 papers

cs.IT2026

The Optimal Asymptotic Rate of Generalized Covering Codes

Hengzhuo Li, Chong Shangguan, Hengjia Wei

Let $G_{q}$ be an alphabet of size $q \geq 2$ . We determine the optimal asymptotic rate of generalized covering codes $C \subseteq G_{q}^{n}$ , whose covering centers in $G_{q}^{t \times n}$ ar…

cs.IT2026

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,…

cs.IT2024

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…