New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces

DOI10.1007/S10623-019-00649-2zbMath1428.51003arXiv1808.09301OpenAlexW2964273263MaRDI QIDQ2334437

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

projective spacescovering codeslength functionsaturating sets

Mathematics Subject Classification ID

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

Related Items (8)

On cutting blocking sets and their codes ⋮ Small Strong Blocking Sets by Concatenation ⋮ Constructing saturating sets in projective spaces using subgeometries ⋮ Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ Grassmannians of codes ⋮ Outer strong blocking sets ⋮ 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\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blocking and double blocking sets in finite planes
• Linear nonbinary covering codes and saturating sets in projective spaces
• Galois geometries and coding theory
• Some optimal codes from algebraic geometry and their covering radii
• Saturated configurations of points in projective Galois spaces
• The packing problem in statistics, coding theory and finite projective spaces
• On saturating sets in projective spaces.
• On saturating sets in small projective geometries
• Linear codes with covering radius 3
• New bounds for linear codes of covering radii 2 and 3
• Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\)
• On defining sets for projective planes
• Construction of linear covering codes
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• Applications of finite geometry in coding theory and cryptography
• Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
• Short codes with a given covering radius
• Linear codes with covering radius R=2, 3 and codimension tR
• Constructions and families of nonbinary linear codes with covering radius 2
• Constructions and families of covering codes and saturated sets of points in projective geometry
• The Weights in MDS Codes
• On multiple blocking sets in Galois planes
• The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)

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