A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909055133417472 |
|---|---|
| author | Shapiro, Andrey |
| author_facet | Shapiro, Andrey |
| contents | In this short note we revisit the upper bound of the asymptotic least density of covering codes of radius $R$ in $[q]^n$ established by Krivelevich, Sudakov, and Vu. We show that by using a slightly different optimization in their core theorem we can obtain a constant factor improvement to their upper bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_19094 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$ Shapiro, Andrey Combinatorics In this short note we revisit the upper bound of the asymptotic least density of covering codes of radius $R$ in $[q]^n$ established by Krivelevich, Sudakov, and Vu. We show that by using a slightly different optimization in their core theorem we can obtain a constant factor improvement to their upper bound. |
| title | A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.19094 |