Improves the upper bound on the asymptotic least density of covering codes of radius R in [q]^n by a constant factor via a modified optimization in the core theorem of Krivelevich, Sudakov, and Vu.
Cohen, Iiro S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$
Improves the upper bound on the asymptotic least density of covering codes of radius R in [q]^n by a constant factor via a modified optimization in the core theorem of Krivelevich, Sudakov, and Vu.