Minimal 1-saturating sets and complete caps in binary projective spaces.

DOI10.1016/j.jcta.2005.06.003zbMath1100.51007MaRDI QIDQ2490862

Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco

Publication date: 18 May 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.06.003

zbMATH Keywords

projective spaces; binary complete caps; binary minimal saturating sets

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

51E22: Linear codes and caps in Galois spaces

51E21: Blocking sets, ovals, (k)-arcs

Related Items

On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
• Saturated configurations of points in projective Galois spaces
• On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
• On saturating sets in projective spaces.
• On saturating sets in small projective geometries
• Complete caps in projective spaces PG\((n,q)\)
• Long binary linear codes and large caps in projective space
• A family of complete caps in \(\mathbf{PG}(n,2)\)
• Classification and constructions of complete caps in binary spaces
• Constructions of small complete caps in binary projective spaces
• Linear codes with covering radius 2 and other new covering codes
• New covering codes from an ADS-like construction
• On the covering radius of codes
• Short codes with a given covering radius
• New codes from old; a new geometric construction