Chong Shangguan

The Optimal Asymptotic Rate of Generalized Covering Codes

Let $G_q$ be an alphabet of size $q\geq2$. We determine the optimal asymptotic rate of generalized covering codes $C\subseteq G_q^n$, whose covering centers in $G_q^{t\times n}$ are constrained to the product form $C^t$. For every fixed integer $t\geq1$ and every $\rho\in[0,1]$, we prove that \[ \kappa_t(\rho,q)= \begi...