Long binary linear codes and large caps in projective space

DOI10.1023/A:1008346303015zbMath0977.94050OpenAlexW1542825462MaRDI QIDQ1963172

David L. 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

zbMATH Keywords

capslinear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Related Items

On the non-trivial minimal blocking sets in binary projective spaces ⋮ 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)\) ⋮ New codes from old; a new geometric construction ⋮ Minimal 1-saturating sets and complete caps in binary projective spaces. ⋮ Doubling and projection: A method of constructing two-level designs of resolution IV ⋮ 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 ⋮ Constructions of small complete caps in binary projective spaces