Long binary linear codes and large caps in projective space
A \textit{cap} in \(PG(n,2)\) is a set of points, no three of which lie on a line. A cap is called \textit{maximal} if cannot be extended to a larger cap. \textit{A. A. Davydov} and \textit{L. M. Tombak} [Probl. Inf. Transm. 25, No. 4, 265-275 (1989; Zbl 0711.94018)] showed that if the size of a maximal cap \(S\) in \(PG(n,2)\) is at least \(2^{n-1}+2\), then \(S\) can be obtained by doubling a cap in lower dimensions. Therefore, in order to determine the structure of large maximal caps in \(PG(n,2)\), it suffices to determine the structure of so-called \textit{critical caps}, i.e. caps of size \(2^{n-1}+1\), that are maximal in \(PG(n,2)\). In this paper the structure of maximal critical caps in \(PG(n,2)\) is determined. It is shown that a maximal critical cap is either \(P_1\)-decomposable, or has a tangent hyperplane. Structure theorems are given describing the caps of both types. Rephrased for codes the result yields a complete classification of all long inextendable binary linear codes of minimum distance 4. The paper moreover presents several related constructions and results.
- scientific article; zbMATH DE number 1229718
- scientific article; zbMATH DE number 1439466
- Binary caps with many free pairs of points
- Caps of order 3\(q^{2}\) in affine 4-space in characteristic 2
- Large caps
- New codes from old; a new geometric construction
- On the maximality of linear codes
- A geometric non-existence proof of an extremal additive code
- scientific article; zbMATH DE number 2154104
- The sizes \(k\) of the complete \(k\)-caps in \(PG(n,q)\), for small \(q\) and \(3\leq n \leq 5\)
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- Some results on \(2^{n - m}\) designs of resolution IV with (weak) minimum aberration
- Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\)
- A family of complete caps in \(\mathbf{PG}(n,2)\)
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Doubling and projection: A method of constructing two-level designs of resolution IV
- Constructions of small complete caps in binary projective spaces
- On the non-trivial minimal blocking sets in binary projective spaces
- scientific article; zbMATH DE number 1229718 (Why is no real title available?)
- A geometric construction of an optimal [67,9,30] binary code
- Cap codes arising from duality
- New codes from old; a new geometric construction
- The third generalized covering radius for binary primitive double-error-correcting BCH codes
- On the second generalized covering radius for binary primitive triple-error-correcting BCH codes
- Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
This page was built for publication: Long binary linear codes and large caps in projective space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963172)
