A family of complete caps in \(\mathbf{PG}(n,2)\)

DOI10.1007/s10623-003-6737-8zbMath1081.51007OpenAlexW2034630642MaRDI QIDQ2486865

Petr Lisoněk, Mahdad Khatirinejad

Publication date: 17 August 2005

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-003-6737-8

zbMATH Keywords

designsbinary linear codes

Mathematics Subject Classification ID

Linear codes and caps in Galois spaces (51E22) Combinatorial structures in finite projective spaces (51E20)

Related Items (3)

Minimal 1-saturating sets and complete caps in binary projective spaces. ⋮ Classification and constructions of complete caps in binary spaces ⋮ 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
• Sum-free sets in vector spaces over \(GF(2)\)
• On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
• \(2^{n-l}\) designs with weak minimum aberration
• Long binary linear codes and large caps in projective space
• Linear codes with covering radius 2 and other new covering codes
• 5‐chromatic steiner triple systems

This page was built for publication: A family of complete caps in \(\mathbf{PG}(n,2)\)