The Optimal Asymptotic Rate of Generalized Covering Codes

Abstract: Let $G_q$ be an alphabet of size $q\geq2$. We determine the optimal asymptotic rate of generalized covering codes $C\subseteq G_q<sup>n$, whose covering centers in $G_q^{t\times n}$ are constrained to the product form $C<sup>t$. For every fixed integer $t\geq1$ and every $ρ\in[0,1]$, we prove that [ κt(ρ,q)= \begin{cases} 1-H{q^t}(ρ),&0\leqρ<1-q^{-t},\ 0,&1-q^{-t}\leqρ\leq1, \end{cases} ] where $κ<em>t(ρ,q)$ denotes the minimum asymptotic rate $n<sup>{-1}\log_q|C|$ among codes whose $t$-th covering radius is at most $ρn$, and $H</em>{q<sup>t}$ is the $q<sup>t$-ary entropy function. When $q$ is a prime power, we prove that the same formula holds under the additional requirement that $C\leq\mathbb F_q<sup>n$. Thus, both the product-form constraint and linearity are asymptotically cost-free: the resulting rate is the ordinary sphere-covering rate over an alphabet of size $q<sup>t$. This extends the recent $t=2$ result of Elimelech and Schwartz for codes without a linearity constraint and the classical $t=1$ result of Cohen and Frankl for linear codes, thereby resolving both open problems posed by Elimelech and Schwartz. Our proofs are probabilistic and combine tools from information theory and probabilistic combinatorics, including the method of types, Janson's inequality, the second-moment method, and a structured alteration argument. Direct applications of Janson's inequality and the second-moment method are obstructed by highly dependent pairs of candidate error matrices. We overcome this obstruction by restricting the errors to a balanced exact-type class of optimal exponential size. Standard type-class estimates, together with Shearer's inequality, then give the required bounds on the number of error-matrix pairs whose selected rows have a prescribed difference.