On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces

DOI10.1007/s10623-012-9783-2zbMath1296.51012OpenAlexW2027916974MaRDI QIDQ2249785

Assia Rousseva, Ivan N. Landgev

Publication date: 3 July 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9783-2

zbMATH Keywords

finite affine spaces\(k\)-arcs\(t\)-fold blocking setsBruen's bound\(t\)-intersection sets

Mathematics Subject Classification ID

Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20)

Related Items (3)

Covering grids with multiplicity ⋮ A general construction for blocking sets in finite affine geometries ⋮ A \(p\)-adic condition on the weight of a codeword of a linear code

Cites Work

• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Polynomial multiplicities over finite fields and intersection sets
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• On multiple nuclei and a conjecture of Lunelli and Sce
• On intersection sets in Desarguesian affine spaces
• Intersection sets in AG(\(n,q\)) and a characterization of the hyperbolic quadric in PG\((3,q\))
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• A Bound for the Maximum Weight of a Linear Code

This page was built for publication: On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces