{ "id": "2305.11955", "version": "v1", "published": "2023-05-19T18:32:24.000Z", "updated": "2023-05-19T18:32:24.000Z", "title": "New bounds for covering codes of radius 3 and codimension 3t+1", "authors": [ "Alexander A. Davydov", "Stefano Marcugini", "Fernanda Pambianco" ], "comment": "19 pages, 3 figures", "categories": [ "math.CO", "cs.IT", "math.IT" ], "abstract": "The smallest possible length of a $q$-ary linear code of covering radius $R$ and codimension (redundancy) $r$ is called the length function and is denoted by $\\ell_q(r,R)$. In this work, for $q$ \\emph{an arbitrary prime power}, we obtain the following new constructive upper bounds on $\\ell_q(3t+1,3)$: $\\ell_q(r,3)\\lessapprox \\sqrt[3]{k}\\cdot q^{(r-3)/3}\\cdot\\sqrt[3]{\\ln q},~r=3t+1, ~t\\ge1, ~ q\\ge\\lceil\\mathcal{W}(k)\\rceil, 18