Design theory
A new class of symmetric (v, k, &lgr;)-designs
Designs, Codes and Cryptography
Discrete Mathematics
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Building Symmetric Designs With Building Sets
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Strongly Regular Graphs and Designs with Three IntersectionNumbers
Designs, Codes and Cryptography
Doubly regular digraphs and symmetric designs
Journal of Combinatorial Theory Series A
On a Class of Symmetric Balanced Generalized Weighing Matrices
Designs, Codes and Cryptography
Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs
Designs, Codes and Cryptography
A recursive construction for new symmetric designs
Designs, Codes and Cryptography
A series of Menon designs and 1-rotational designs
Finite Fields and Their Applications
| Hi-index | 0.00 |
Let M be a set of incidence matrices of symmetric(v,k,λ)-designs and G a group of mappings M→ M. We give asufficient condition for the matrix W⊗ M, where M∈ M and W is abalanced generalized weighing matrix over G, to be the incidence matrix of alarger symmetric design. This condition is then applied to the designscorresponding to McFarland and Spence difference sets, and it results infour families of symmetric (v,k,λ )-designs with the followingparameters k and λ (m and d are positive integers, p and q are primepowers): (i) k = q^2m-1p^d, λ =(q-1)q^2m-2p^d-1, q = p^d+1-1/p-1; (ii) k =(q^2m-1p^d-1)p^d/(p-1)(p^d+1),λ =(q^2m-2p^2d-1)p^d/(p-1)(p^d+1),q = p^d+1+p-1; (iii) k = 3^dq^2m-1,λ = 3^d(3^d+1)q^2m-2/2, q =3^d+1+1/2; (iv) k =3^d(3^dq^2m-1-1/2(3^d-1), λ =3^d(3^2dq^2m-2-1)/2(3^d-1), q = 3^d+1-2.