AbstractThe only 2−(v,k,λ) designs with r⩾2λ and k⩾λ in which a minimal blocking 3-set may exist are the following: a 2−(2λ+3,λ+1,λ) design with λ⩾3; a 2−(2λ+2,λ+1,λ) design with λ⩾3; a 2−(2λ−1,λ,λ) design with λ⩾4; a 2−(4λ+3,2λ+1,λ) Hadamard design with λ⩾3; a 2−(4λ−1,2λ+1,λ) Hadamard design with λ⩾2; see L. Berardi (A note on 3-blocked designs, J. Combin. Designs 5 (1) (1997) 61–69). Moreover, in Berardi (1997) the case of Hadamard designs has been studied. In this paper we deal with the problem of the existence of blocking 3-sets in the remaining designs
AbstractLet S1, …, Sn, n>1, be subsets of an n-set S where |Si|>λ≥1 and |Si∩Sj|=λ for i≠j. Then our ...
AbstractA λ-design is a family B1, B2, …, Bv of subsets of X = {1, 2, …, v} such that |Bi ∩ Bj| = λ ...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
Abstractt−(2k, k, λ) designs having a property similar to that of Hadamard 3-designs are studied. We...
The existence of blocking sets in (υ, {2, 4}, 1)-designs is examined. We show that for υ = 0, 3, 5, ...
AbstractIn this paper, we give constructions of block designs with block size 4 and index λ, for λ =...
AbstractThe important role of Hadamard designs for applications in several fields has been long esta...
AbstractThe important role of Hadamard designs for applications in several fields has been long esta...
AbstractIn this paper we give a bound for the cardinality of an intersection set of a 2-(v,k,λ) desi...
The important role of Hadamard designs for applications in several fields has been long established....
AbstractWe prove that there exists an Sλ(2, 3, v) without repeated blocks if and only if λ⩽v−2, λυ(υ...
AbstractA lower bound is obtained for the cardinality of a blocking set in a non-symmetric block des...
AbstractAλ-design is a family ofvsubsets (blocks) of av-set such that any two distinct blocks inters...
AbstractIn this paper we give a bound for the cardinality of an intersection set of a 2-(v,k,λ) desi...
AbstractIn this paper, we give constructions of block designs with block size 4 and index λ, for λ =...
AbstractLet S1, …, Sn, n>1, be subsets of an n-set S where |Si|>λ≥1 and |Si∩Sj|=λ for i≠j. Then our ...
AbstractA λ-design is a family B1, B2, …, Bv of subsets of X = {1, 2, …, v} such that |Bi ∩ Bj| = λ ...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
Abstractt−(2k, k, λ) designs having a property similar to that of Hadamard 3-designs are studied. We...
The existence of blocking sets in (υ, {2, 4}, 1)-designs is examined. We show that for υ = 0, 3, 5, ...
AbstractIn this paper, we give constructions of block designs with block size 4 and index λ, for λ =...
AbstractThe important role of Hadamard designs for applications in several fields has been long esta...
AbstractThe important role of Hadamard designs for applications in several fields has been long esta...
AbstractIn this paper we give a bound for the cardinality of an intersection set of a 2-(v,k,λ) desi...
The important role of Hadamard designs for applications in several fields has been long established....
AbstractWe prove that there exists an Sλ(2, 3, v) without repeated blocks if and only if λ⩽v−2, λυ(υ...
AbstractA lower bound is obtained for the cardinality of a blocking set in a non-symmetric block des...
AbstractAλ-design is a family ofvsubsets (blocks) of av-set such that any two distinct blocks inters...
AbstractIn this paper we give a bound for the cardinality of an intersection set of a 2-(v,k,λ) desi...
AbstractIn this paper, we give constructions of block designs with block size 4 and index λ, for λ =...
AbstractLet S1, …, Sn, n>1, be subsets of an n-set S where |Si|>λ≥1 and |Si∩Sj|=λ for i≠j. Then our ...
AbstractA λ-design is a family B1, B2, …, Bv of subsets of X = {1, 2, …, v} such that |Bi ∩ Bj| = λ ...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...