Long binary linear codes and large caps in projective space
From MaRDI portal
Publication:1963172
DOI10.1023/A:1008346303015zbMATH Open0977.94050OpenAlexW1542825462MaRDI QIDQ1963172FDOQ1963172
Authors: David Wehlau, Aiden A. Bruen 
Publication date: 24 January 2000
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008346303015
Recommendations
- 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\)
Cited In (12)
- New codes from old; a new geometric construction
- Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
- Cap codes arising from duality
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- On the non-trivial minimal blocking sets in binary projective spaces
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Some results on \(2^{n - m}\) designs of resolution IV with (weak) minimum aberration
- Doubling and projection: A method of constructing two-level designs of resolution IV
- A geometric construction of an optimal [67,9,30] binary code
- 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)\)
- Constructions of small complete caps in binary projective spaces
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)
