Classification and constructions of complete caps in binary spaces
From MaRDI portal
Publication:2491283
DOI10.1007/s10623-005-2140-yzbMath1172.51306MaRDI QIDQ2491283
Petr Lisoněk, Mahdad Khatirinejad
Publication date: 29 May 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-2140-y
fractional factorial designs; binary linear codes; complete caps; Galois geometries; Caps; isomorph-free generation
Related Items
On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\), Minimal 1-saturating sets and complete caps in binary projective spaces., On the binary projective codes with dimension 6
Uses Software
Cites Work
- Sum-free sets in vector spaces over \(GF(2)\)
- \(2^{n-l}\) designs with weak minimum aberration
- A family of small complete caps in \(\text{PG}(n,2)\)
- An orderly algorithm and some applications in finite geometry
- There exist caps which block all spaces of fixed codimension in \(\mathbb{P}\mathbb{G} (n,2)\)
- A family of complete caps in \(\mathbf{PG}(n,2)\)
- Linear codes with covering radius 2 and other new covering codes
- 5‐chromatic steiner triple systems
- A Catalogue of Two-Level and Three-Level Fractional Factorial Designs with Small Runs
- New codes from old; a new geometric construction
- Unnamed Item
