Linear nonbinary covering codes and saturating sets in projective spaces
From MaRDI portal
Publication:534526
DOI10.3934/AMC.2011.5.119zbMATH Open1229.94056arXiv0904.3835OpenAlexW2014025706MaRDI QIDQ534526FDOQ534526
Authors: Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco 
Publication date: 17 May 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Abstract: Let A_{R,q} denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. In this paper, infinite sets of families A_{R,q}, where R is fixed but q ranges over an infinite set of prime powers are considered, and the dependence on q of the asymptotic covering densities of A_{R,q} is investigated. It turns out that for the upper limit of the covering density of A_{R,q}, the best possibility is O(q). The main achievement of the present paper is the construction of asymptotic optimal infinite sets of families A_{R,q} for any covering radius R >= 2. We first showed that for a given R, to obtain optimal infinite sets of families it is enough to construct R infinite families A_{R,q}^{(0)},A_{R,q}^{(1)},...,A_{R,q}^{(R-1)} such that, for all u >= u_{0}, the family A_{R,q}^{(v)} contains codes of codimension r_{u}=Ru+v and length f_{q}^{v}(r_{u}) where f_{q}^{v}(r)=O(q^{(r-R)/R) and u_{0} is a constant. Then, we were able to construct the needed families A_{R,q}^{(v)} for any covering radius R >= 2, with q ranging over the (infinite) set of R-th powers. For each of these families A_{R,q}^{(v)}, the lower limit of the covering density is bounded from above by a constant independent of q.
Full work available at URL: https://arxiv.org/abs/0904.3835
Recommendations
- Constructions and families of covering codes and saturated sets of points in projective geometry
- New bounds for linear codes of covering radius 2
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Linear codes with covering radius 3
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cited In (37)
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- Strong blocking sets and minimal codes from expander graphs
- Saturating sets in projective planes and hypergraph covers
- On sizes of complete arcs in \(PG(2,q)\)
- On cutting blocking sets and their codes
- On finite models of Hilbert's incidence geometry
- 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\)
- Constructing saturating sets in projective spaces using subgeometries
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Transitive \(\mathrm{PSL}(2,7)\)-invariant 42-arcs in 3-dimensional projective spaces
- Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane
- Transitive \(A_6\)-invariant \(k\)-arcs in \(\mathrm{PG}(2,q)\)
- Three combinatorial perspectives on minimal codes
- Further results on multiple coverings of the farthest-off points
- Saturating linear sets of minimal rank
- Saturating systems and the rank-metric covering radius
- 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
- The 2-blocking number and the upper chromatic number of \(\operatorname{PG}(2,q)\)
- Higgledy-piggledy sets in projective spaces of small dimension
- Linear cutting blocking sets and minimal codes in the rank metric
- On the minimum size of complete arcs and minimal saturating sets in projective planes
- On the lower bound for the length of minimal codes
- A higgledy-piggledy set of planes based on the ABB-representation of linear sets
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- New bounds for linear codes of covering radii 2 and 3
- Outer strong blocking sets
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
- On saturating sets in small projective geometries
- Multiple coverings of the farthest-off points with small density from projective geometry
- Small Strong Blocking Sets by Concatenation
- Covering of subspaces by subspaces
This page was built for publication: Linear nonbinary covering codes 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 Q534526)
