Linear nonbinary covering codes and saturating sets in projective spaces

DOI10.3934/amc.2011.5.119zbMath1229.94056arXiv0904.3835OpenAlexW2014025706MaRDI QIDQ534526

Massimo Giulietti, Fernanda Pambianco, Stefano Marcugini, Alexander A. Davydov

Publication date: 17 May 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

covering densitysaturating sets in projective spaceslinear covering codesnonbinary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial codes (94B25)

Related Items (26)

Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ On cutting blocking sets and their codes ⋮ Small Strong Blocking Sets by Concatenation ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ Further results on multiple coverings of the farthest-off points ⋮ Higgledy-piggledy sets in projective spaces of small dimension ⋮ Constructing saturating sets in projective spaces using subgeometries ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ On the lower bound for the length of minimal codes ⋮ A higgledy-piggledy set of planes based on the ABB-representation of linear sets ⋮ Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\) ⋮ Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ Saturating systems and the rank-metric covering radius ⋮ Saturating sets in projective planes and hypergraph covers ⋮ Transitive \(A_6\)-invariant \(k\)-arcs in \(\mathrm{PG}(2,q)\) ⋮ New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane ⋮ On the minimum size of complete arcs and minimal saturating sets in projective planes ⋮ On sizes of complete arcs in \(PG(2,q)\) ⋮ Transitive \(\mathrm{PSL}(2,7)\)-invariant 42-arcs in 3-dimensional projective spaces ⋮ The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q) ⋮ The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\) ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces ⋮ New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane ⋮ Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture

This page was built for publication: Linear nonbinary covering codes and saturating sets in projective spaces