Add to ORKGThe important role of Hadamard designs for applications in several fields has been long established. A considerable problem of finite geometry is to determine the configuration of the minimum number of points that block a design, i.e. the shape of a minimum set of points which have at least one point in common with any block. In this paper we del with Hadamard 3-designs blocked by only four points
In this paper it is shown that an Hadamard design with each letter repeated once and only once can ...
A symmetric 2-(324, 153, 72) design is constructed that admits a tactical decomposition into 18 poin...
A symmetric 2-(324, 153, 72) design is constructed that admits a tactical decomposition into 18 poin...
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...
AbstractThe only 2−(v,k,λ) designs with r⩾2λ and k⩾λ in which a minimal blocking 3-set may exist are...
In this paper we study the representations of the 2-(11,5,2) Hadamard design H_11 = (P,B) as a set o...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
A line of a design is the intersection of all the blocks on two points. There is an upper bound on t...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
Quasi-symmetric triangle-free designs D with block intersection numbers 0 and y and with no three mu...
AbstractQuasi-symmetric triangle-free designs D with block intersection numbers 0 and y and with no ...
AbstractIt was shown by Singhi that there are 21 nonisomorphic block designs BD (10, 5; 18, 9, 4) wh...
Abstractt−(2k, k, λ) designs having a property similar to that of Hadamard 3-designs are studied. We...
In this paper it is shown that an Hadamard design with each letter repeated once and only once can ...
A symmetric 2-(324, 153, 72) design is constructed that admits a tactical decomposition into 18 poin...
A symmetric 2-(324, 153, 72) design is constructed that admits a tactical decomposition into 18 poin...
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...
AbstractThe only 2−(v,k,λ) designs with r⩾2λ and k⩾λ in which a minimal blocking 3-set may exist are...
In this paper we study the representations of the 2-(11,5,2) Hadamard design H_11 = (P,B) as a set o...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
A line of a design is the intersection of all the blocks on two points. There is an upper bound on t...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
Quasi-symmetric triangle-free designs D with block intersection numbers 0 and y and with no three mu...
AbstractQuasi-symmetric triangle-free designs D with block intersection numbers 0 and y and with no ...
AbstractIt was shown by Singhi that there are 21 nonisomorphic block designs BD (10, 5; 18, 9, 4) wh...
Abstractt−(2k, k, λ) designs having a property similar to that of Hadamard 3-designs are studied. We...
In this paper it is shown that an Hadamard design with each letter repeated once and only once can ...
A symmetric 2-(324, 153, 72) design is constructed that admits a tactical decomposition into 18 poin...
A symmetric 2-(324, 153, 72) design is constructed that admits a tactical decomposition into 18 poin...