New Constructions of Affine Blocking Sets
New Constructions of Affine Blocking Sets
Author(s): Assia Rousseva, Ivan LandjevSubject(s): Economy, ICT Information and Communications Technologies
Published by: Нов български университет
Keywords: Affine blocking sets; Bruen’s bound; Finite affine geometry; Arcs; Blocking sets; Computing Classification system - 2012; Mathematics and computing; Discrete mathematics; Coding theory
Summary/Abstract: A t-fold blocking set with respect to the hyperplanes is a set of n points in AG(r,q) that meets each hyperplane in at least t points.The cardinality of such blocking set satisfies the following lower bound known as Bruen's bound : n≥ (t+r-1)(q-1)+1.Several classes of blocking sets meeting Bruen's bound are know . It is conjectured that there exists a constant C such that for t>C there exist no affine t-fold blocking sets meeting this bound. In this talk, wepresent several new constructions of affine t-fold blocking sets that are close to Bruen's bound.
Journal: Computer Science and Education in Computer Science
- Issue Year: 13/2017
- Issue No: 1
- Page Range: 381-389
- Page Count: 9
- Language: English