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

DOI10.3934/AMC.2015.9.63MaRDI QIDQ2018430zbMATH OpenOpenAlexFDO

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)

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

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)

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.

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

Cites work

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

Cited in

(5)

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

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)