Further results on multiple coverings of the farthest-off points

DOI10.3934/AMC.2016030MaRDI QIDQ326345zbMATH OpenOpenAlexFDO

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

Publication date 12 October 2016

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

Full work available at URL https://doi.org/10.3934/amc.2016030

zbMATH Keywords

covering densitycovering codesfarthest-off pointsmultiple coveringssaturating sets in projective spaces

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Combinatorial codes (94B25) Linear codes and caps in Galois spaces (51E22) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Multiple coverings of the farthest-off points with small density from projective geometry
• Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
• Optimal covering points and related problems
• scientific article; zbMATH DE number 5175639
• On the approximability of covering points by lines and related problems
• On the \(C\)-farthest points
• On point covers of multiple intervals and axis-parallel rectangles
• Farthest points and strong convexity of sets
• scientific article; zbMATH DE number 3863852
• On farthest and simultaneous farthest points in Köthe spaces

Cites work

• scientific article; zbMATH DE number 1284421 (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 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
• Multiple coverings of the farthest-off points with small density from projective geometry
• New inductive constructions of complete caps in \(\mathrm{PG}(N, q)\), \(q\) even
• 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 minimum size of complete arcs and minimal saturating sets in projective planes
• On the normality of multiple covering codes
• Quasi-Perfect Linear Codes With Minimum Distance $4$
• Small complete caps in PG(N, q), q even
• Some combinatorial aspects of constructing bipartite-graph 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)

• Multiple coverings of the farthest-off points with small density from projective geometry
• 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
• Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
• 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: Further results on multiple coverings of the farthest-off points

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