Multiple coverings of the farthest-off points with small density from projective geometry

DOI10.3934/AMC.2015.9.63zbMATH Open1314.51004arXiv1506.00392OpenAlexW2035466351MaRDI QIDQ2018430FDOQ2018430

Authors: Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco, Alexander A. Davydov, Massimo Giulietti 

Publication date: 14 April 2015

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

Abstract: Multiple coverings of the farthest-off points ($(R,mu)$-MCF codes) and the corresponding $(ho,mu)$-saturating sets in projective spaces $PG(N,q)$ are considered. We propose and develop some methods which allow us to obtain new small $(1,mu)$-saturating sets and short $(2,mu)$-MCF codes with $mu$-density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly $1+1/cq$, $cge1$). In particular, we provide new algebraic constructions and some bounds. Also, we classify minimal and optimal $(1,mu)$-saturating sets in $PG(2,q)$, $q$ small.

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

Recommendations

• Further results on multiple coverings of the farthest-off points
• Covering points with convex sets of minimum size
• Covering Points with Convex Sets of Minimum Size
• scientific article; zbMATH DE number 91039
• On point sets with many unit distances in few directions
• On smallest covers of finite projective spaces
• On saturating sets in small projective geometries
• Multiplicities of interpoint distances in finite planar sets
• Optimal covering points and related problems
• Covering Many or Few Points with Unit Disks

zbMATH Keywords

covering densitycovering codesfarthest-off pointsmultiple coveringssaturating sets in projective spaces

Mathematics Subject Classification ID

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

Cites Work

• The Geometry of Two-Weight Codes
• Title not available (Why is that?)
• Random constructions and density results
• On defining sets for projective planes
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear nonbinary covering codes and saturating sets in projective spaces
• Small complete caps in PG(N, q), q even
• Title not available (Why is that?)
• Sets of type \((a,b)\) from subgroups of \(\Gamma L (1, p^R)\)
• Some combinatorial aspects of constructing bipartite-graph codes
• On constructions and parameters of symmetric configurations \(v_k\)
• On small dense sets in Galois planes
• Bounds for binary multiple covering codes
• On the normality of multiple covering codes
• A new table of binary/ternary mixed covering codes
• A note on perfect multiple coverings of the Hamming space
• Quasi-Perfect Linear Codes With Minimum Distance $4$
• On Cryptosystems Based on Polynomials and Finite Fields
• Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
• Football Pools--A Game for Mathematicians
• Constructions and families of covering codes and saturated sets of points in projective geometry
• Title not available (Why is that?)
• Title not available (Why is that?)
• On codes with given minimum distance and covering radius
• Upper bounds for football pool problems and mixed covering codes
• Some sets of type \((m,n)\) in cubic order planes
• Small complete caps from singular cubics. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
• Short codes with a given covering radius
• Title not available (Why is that?)
• On the number of rational points of generalized Fermat curves over finite fields

Cited In (5)

• On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
• On the weight distribution of the cosets of MDS codes
• Further results on multiple coverings of the farthest-off points
• The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
• Intersection sets, three-character multisets and associated codes

This page was built for publication: Multiple coverings of the farthest-off points with small density from projective geometry

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