Recursive constructions of complete caps
A cap \(K\) is a set of points in \(PG(d,q)\) no three of which are collinear. A cap is complete if it is not contained in any larger cap. The minimum number of points in a complete cap is denoted by \(n_2(d,q)\). Little is known about small complete caps for large dimensions. Upper bounds for \(n_2(d,q)\) are known for \(q\) even, but there is little in the literature concerning the odd characteristic case. In this paper the authors present three recursive constructions of complete caps when \(q\) is odd. These constructions imply the following results: For \(k \geq 0\), \[ n_2(k+1,3) \leq 2n_2(k,3). \] Let \(q \geq 5\) be an odd prime power and \(k \geq 0\). Then \[ n_2(4k+2,q) \leq q^{2k+1} + n_2(2k,q). \] And, let \(q \geq 9\) be an odd prime power and \(k \geq 0\). Then \[ n_2(4k+2,q) \leq q^{2k+1} - (q+1) + n_2(2k,q) + n_2(2,q). \]
- Recursive constructions for large caps
- scientific article; zbMATH DE number 1226455
- Classification and constructions of complete caps in binary spaces
- On a Construction of Caps
- Construction of caps by means of caps in complementary subspaces
- Cappable recursively enumerable degrees and Post's program
- Publication:4863251
- On recursively enumerable structures
- Covering the Recursive Sets
- Covering the recursive sets
- Computer search for small complete caps
- Covering radii of ternary linear codes of small dimensions and codimensions
- scientific article; zbMATH DE number 3823809 (Why is no real title available?)
- scientific article; zbMATH DE number 1188995 (Why is no real title available?)
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- Linear codes with covering radius 2 and other new covering codes
- Lower bounds on \(m_t(r,s)\)
- New constructions for q-ary covering codes
- New linear codes with covering radius 2 and odd basis
- Small complete caps in spaces of even characteristic
- The packing problem in statistics, coding theory and finite projective spaces
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- Caps in \(\mathrm{PG}(n,q)\), \(q\) even, \(n\ge 3\)
- Recursive constructions for large caps
- Small complete caps in spaces of even characteristic
- Small complete caps from singular cubics. II
- A construction of small complete caps in projective spaces
- Small complete caps in three-dimensional Galois spaces
- Classification and constructions of complete caps in binary spaces
- Small Complete Caps from Singular Cubics
- New inductive constructions of complete caps in \(\mathrm{PG}(N, q)\), \(q\) even
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N \geq 3\), under a certain probabilistic conjecture
- Exponentially larger affine and projective caps
- Small complete caps in PG(4n+1,q)${\rm PG}(4n+1, q)$
- Complete 3-term arithmetic progression free sets of small size in vector spaces and other abelian groups
- A new construction of caps
- Maximum scattered linear sets and complete caps in Galois spaces
- Small complete caps in Galois affine spaces
- Construction of caps by means of caps in complementary subspaces
This page was built for publication: Recursive constructions of complete caps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935436)
