Further results on multiple coverings of the farthest-off points

DOI10.3934/amc.2016030zbMath1348.94094OpenAlexW2962686925MaRDI QIDQ326345

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

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

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ 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
• 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
• 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
• Some combinatorial aspects of constructing bipartite-graph codes
• Multiple coverings of the farthest-off points with small density from projective geometry
• On the minimum size of complete arcs and minimal saturating sets in projective planes
• On defining sets for projective planes
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• A note on perfect multiple coverings of the Hamming space
• Quasi-Perfect Linear Codes With Minimum Distance $4$
• New inductive constructions of complete caps inPG(N, q),qeven
• 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
• On codes with given minimum distance and covering radius

This page was built for publication: Further results on multiple coverings of the farthest-off points