Note on disjoint blocking sets in Galois planes

2006 ◽  
Vol 14 (2) ◽  
pp. 149-158 ◽  
Author(s):  
János Barát ◽  
Stefano Marcugini ◽  
Fernanda Pambianco ◽  
Tamás Szőnyi
Keyword(s):  
Blocking Sets ◽  
Galois Planes

scholarly journals On multiple blocking sets in Galois planes

2007 ◽  
Vol 7 (1) ◽  
pp. 39-53 ◽  
Author(s):  
A Blokhuis ◽  
L Lovász ◽  
L Storme ◽  
T Szőnyi
Keyword(s):  
Pairwise Disjoint ◽  
London Math ◽  
Algebraic Curves ◽  
Blocking Sets ◽  
Baer Subplane ◽  
Baer Subplanes ◽  
Galois Planes

AbstractThis article continues the study of multiple blocking sets in PG(2,q). In [A. Blokhuis, L. Storme, T. Szőnyi, Lacunary polynomials, multiple blocking sets and Baer subplanes.J. London Math. Soc. (2)60(1999), 321–332. MR1724814 (2000j:05025) Zbl 0940.51007], using lacunary polynomials, it was proven thatt-fold blocking sets of PG(2,q),qsquare,t<q¼/2, of size smaller thant(q+ 1) +cqq⅔, withcq= 2−⅓whenqis a power of 2 or 3 andcq= 1 otherwise, contain the union oftpairwise disjoint Baer subplanes whent≥ 2, or a line or a Baer subplane whent= 1. We now combine the method of lacunary polynomials with the use of algebraic curves to improve the known characterization results on multiple blocking sets and to prove at(modp) result on smallt-fold blocking sets of PG(2,q=pn),pprime,n≥ 1.

scholarly journals Small proper double blocking sets in Galois planes of prime order

2008 ◽  
Vol 308 (18) ◽  
pp. 4052-4056
Author(s):  
Petr Lisoněk ◽  
Joanna Wallis
Keyword(s):  
Prime Order ◽  
Blocking Sets ◽  
Galois Planes

scholarly journals Full Characterization of Minimal Linear Codes as Cutting Blocking Sets

2021 ◽  
pp. 1-1
Author(s):  
Chunming Tang ◽  
Yan Qiu ◽  
Qunying Liao ◽  
Zhengchun Zhou
Keyword(s):  
Linear Codes ◽  
Blocking Sets ◽  
Full Characterization

Blocking sets in 3-designs

1989 ◽  
Vol 35 (1-2) ◽  
pp. 75-86 ◽  
Author(s):  
Mario Gionfriddo ◽  
Biagio Micale
Keyword(s):  
Blocking Sets

scholarly journals The size of m-irreducible blocking sets and of the sets of class [0,n1,…,nl]

2008 ◽  
Vol 308 (2-3) ◽  
pp. 180-183
Author(s):  
S. Rajola ◽  
M. Scafati Tallini
Keyword(s):  
Blocking Sets

scholarly journals The Lower Bounds of Eight and Fourth Blocking Sets and Existence of Minimal Blocking Sets

2007 ◽  
Vol 19 (3) ◽  
pp. 99-111
Author(s):  
L.Yasin Nada Yassen Kasm Yahya ◽  
Abdul Khalik
Keyword(s):  
Lower Bounds ◽  
Blocking Sets ◽  
Minimal Blocking

scholarly journals Blocking sets for cycles and paths designs

2020 ◽  
Vol 14 (1) ◽  
pp. 183-197
Author(s):  
Paola Bonacini ◽  
Lucia Marino
Keyword(s):  
Blocking Set ◽  
Blocking Sets

In this paper, we study blocking sets for C4, P3 and P5-designs. In the case of C4-designs and P3-designs we determine the cases in which the blocking sets have the largest possible range of cardinalities. These designs are called largely blocked. Moreover, a blocking set T for a G-design is called perfect if in any block the number of edges between elements of T and elements in the complement is equal to a constant. In this paper, we consider perfect blocking sets for C4-designs and P5-designs.

Sign in / Sign up

Export Citation Format

Share Document