Constructions of small complete caps in binary projective spaces
From MaRDI portal
Publication:2572978
DOI10.1007/s10623-004-3805-7zbMath1136.51302OpenAlexW2056743588MaRDI QIDQ2572978
Fernanda Pambianco, Alexander A. Davydov, Giorgio Faina
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-004-3805-7
Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21)
Related Items (3)
On the non-trivial minimal blocking sets in binary projective spaces ⋮ Minimal 1-saturating sets and complete caps in binary projective 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
- Small complete arcs in Galois planes
- 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
- Long binary linear codes and large caps in projective space
- Linear codes with covering radius 2 and other new covering codes
- New codes from old; a new geometric construction
This page was built for publication: Constructions of small complete caps in binary projective spaces
