A family of complete caps in PG(n,2)
From MaRDI portal
Publication:2486865
DOI10.1007/S10623-003-6737-8zbMATH Open1081.51007OpenAlexW2034630642MaRDI QIDQ2486865FDOQ2486865
Authors: 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
Recommendations
Combinatorial structures in finite projective spaces (51E20) Linear codes and caps in Galois spaces (51E22)
Cites Work
- On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
- Title not available (Why is that?)
- \(2^{n-l}\) designs with weak minimum aberration
- Linear codes with covering radius 2 and other new covering codes
- 5‐chromatic steiner triple systems
- Sum-free sets in vector spaces over \(GF(2)\)
- Long binary linear codes and large caps in projective space
- Title not available (Why is that?)
Cited In (4)
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- There exist caps which block all spaces of fixed codimension in \(\mathbb{P}\mathbb{G} (n,2)\)
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Classification and constructions of complete caps in binary spaces
This page was built for publication: A family of complete caps in \(\mathbf{PG}(n,2)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486865)