New bounds for covering codes of radius 3 and codimension 3t+1

arXiv2305.11955MaRDI QIDQ6437271FDOQ6437271

Authors: Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco

Publication date: 19 May 2023

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

e l l_{q} (r, R)

. In this work, for

q

emph{an arbitrary prime power}, we obtain the following new constructive upper bounds on

e l l_{q} (3 t + 1, 3)

:

e l l_{q} (r, 3) l e s s a p p r o x s q r t [3] k c d o t q^{(r - 3) / 3} c d o t s q r t [3] l n q, r = 3 t + 1, t g e 1, q g e l c e i l m a t h c a l W (k) c e i l, 18 < k l e 20.339, m a t h c a l W (k) e x t i s a d e c r e a s i n g f u n c t i o n o f k;

e l l_{q} (r, 3) l e s s a p p r o x s q r t [3] 18 c d o t q^{(r - 3) / 3} c d o t s q r t [3] l n q, r = 3 t + 1, t g e 1, q e x t l a r g e e n o u g h .

For

t = 1

, we use a one-to-one correspondence between codes of covering radius 3 and codimension 4, and 2-saturating sets in the projective space

m a t h r m P G (3, q)

. A new construction providing sets of small size is proposed. The codes, obtained by geometrical methods, are taken as the starting ones in the lift-constructions (so-called ``

q^{m}

-concatenating constructions) to obtain infinite families of codes with radius 3 and growing codimension $r = 3 t + 1$ , $t g e 1$ . The new bounds are essentially better than the known ones.

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

This page was built for publication: New bounds for covering codes of radius 3 and codimension 3t+1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437271)