New covering codes of radius R, codimension tr and tr+R2, and saturating sets in projective spaces

DOI10.1007/S10623-019-00649-2MaRDI QIDQ2334437zbMATH OpenOpenAlexFDO

Authors Stefano Marcugini, Fernanda Pambianco, Alexander A. Davydov

Publication date 7 November 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.09301

zbMATH Keywords

covering codessaturating setsprojective spaceslength function

Mathematics Subject Classification ID

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

Abstract: The length function $el{l}_q(r,R)$ is the smallest length of a $q$-ary linear code of codimension $r$ and covering radius $R$. In this work we obtain new constructive upper bounds on $el{l}_q(r,R)$ for all $Rge4$, $r=tR$, $tge2$, and also for all even $Rge2$, $r=tR+fracR2$, $tge1$. The new bounds are provided by infinite families of new covering codes with fixed $R$ and increasing codimension. The new bounds improve upon the known ones. We propose a general regular construction (called ``Line+Ovals) of a minimal $ho$-saturating $((ho+1)q+1)$-set in the projective space $mathrmPG(2ho+1,q)$ for all $hoge0$. Such a set corresponds to an $[Rq+1,Rq+1-2R,3{]}_{q}R$ locally optimal${}^1$ code of covering radius $R=ho+1$. Basing on combinatorial properties of these codes regarding to spherical capsules${}^1$, we give constructions for code codimension lifting and obtain infinite families of new surface-covering${}^1$ codes with codimension $r=tR$, $tge2$. In addition, we obtain new 1-saturating sets in the projective plane $mathrmPG(2,q^2)$ and, basing on them, construct infinite code families with fixed even radius $Rge2$ and codimension $r=tR+fracR2$, $tge1$. (${}^1$ see the definitions in Section 1)

Recommendations

• Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
• Constructions and families of covering codes and saturated sets of points in projective geometry
• Linear nonbinary covering codes and saturating sets in projective spaces
• A new approach to the covering radius of codes
• On covering radius of codes over \(\mathbb{Z}_{2p}\)
• On the Newton and covering radii of linear codes
• New bounds for linear codes of covering radii 2 and 3
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
• Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1284421 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• scientific article; zbMATH DE number 910952 (Why is no real title available?)
• A note on a geometric construction of large Cayley graphs of given degree and diameter
• Applications of finite geometry in coding theory and cryptography
• Blocking and double blocking sets in finite planes
• Construction of linear covering codes
• Constructions and families of covering codes and saturated sets of points in projective geometry
• Constructions and families of nonbinary linear codes with covering radius 2
• Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\)
• Galois geometries and coding theory
• Galois geometries and coding theory
• Linear codes with covering radius 3
• Linear codes with covering radius R=2, 3 and codimension tR
• Linear nonbinary covering codes and saturating sets in projective spaces
• Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
• New bounds for linear codes of covering radii 2 and 3
• On defining sets for projective planes
• On multiple blocking sets in Galois planes
• On saturating sets in projective spaces.
• On saturating sets in small projective geometries
• Saturated configurations of points in projective Galois spaces
• Short codes with a given covering radius
• Some optimal codes from algebraic geometry and their covering radii
• The 2-blocking number and the upper chromatic number of \(\operatorname{PG}(2,q)\)
• The Weights in MDS Codes
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• The packing problem in statistics, coding theory and finite projective spaces

Cited in

(11)

• Linear nonbinary covering codes and saturating sets in projective spaces
• Grassmannians of codes
• On cutting blocking sets and their codes
• Constructing saturating sets in projective spaces using subgeometries
• Further results on covering codes with radius \(R\) and codimension \(tR+1\)
• New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
• Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
• Outer strong blocking sets
• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
• New bounds for linear codes of covering radius 2
• Small Strong Blocking Sets by Concatenation

This page was built for publication: New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces

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