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

DOI10.3934/amc.2015.9.63zbMath1314.51004arXiv1506.00392OpenAlexW2035466351MaRDI QIDQ2018430

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

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 codescovering densityfarthest-off pointsmultiple coveringssaturating sets in projective spaces

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 (5)

Further results on multiple coverings of the farthest-off points ⋮ 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 ⋮ 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)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On constructions and parameters of symmetric configurations \(v_k\)
• Linear nonbinary covering codes and saturating sets in projective spaces
• Upper bounds for football pool problems and mixed covering codes
• Random constructions and density results
• On small dense sets in Galois planes
• Bounds for binary multiple covering codes
• Some sets of type \((m,n)\) in cubic order planes
• On the normality of multiple covering codes
• A new table of binary/ternary mixed covering codes
• Some combinatorial aspects of constructing bipartite-graph codes
• Small complete caps from singular cubics. II
• On defining sets for projective planes
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• ON THE NUMBER OF RATIONAL POINTS OF GENERALIZED FERMAT CURVES OVER FINITE FIELDS
• On Uniformly Packed [n , n -k , 4 Codes over GF(q ) and a Class of Caps in PG(k -1, q )]
• A note on perfect multiple coverings of the Hamming space
• Quasi-Perfect Linear Codes With Minimum Distance $4$
• The Geometry of Two-Weight Codes
• On Cryptosystems Based on Polynomials and Finite Fields
• Short codes with a given covering radius
• 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
• Small complete caps in PG(N, q), q even
• Sets of type \((a,b)\) from subgroups of \(\Gamma L (1, p^R)\)
• On codes with given minimum distance and covering radius

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