Long binary linear codes and large caps in projective space
type: Item
instance of: scholarly article
title: Long binary linear codes and large caps in projective space
zbMATH Open document ID: 0977.94050
DOI: 10.1023/A:1008346303015
author: David Wehlau
author: Aiden A. Bruen
published in: Designs, Codes and Cryptography
publication date: 2000-01-24T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 51E22
zbMATH DE Number: 1392731
zbMATH Keywords: caps
zbMATH Keywords: linear codes
MaRDI profile type: Publication
full work available at URL: a:1008346303015
OpenAlex ID: W1542825462
Recommended article: Q4222157
Recommended article: Q4949845
Recommended article: Binary caps with many free pairs of points
Recommended article: Caps of order 3\(q^{2}\) in affine 4-space in characteristic 2
Recommended article: Large caps
Recommended article: New codes from old; a new geometric construction
Recommended article: On the maximality of linear codes
Recommended article: A geometric non-existence proof of an extremal additive code
Recommended article: Q4664653
Recommended article: The sizes \(k\) of the complete \(k\)-caps in \(PG(n,q)\), for small \(q\) and \(3\leq n \leq 5\)
description: scientific article; zbMATH DE number 1392731