A new family of BIBD's and non-embeddable (16, 24, 9, 6, 3)-designs
Discrete Mathematics - Combinatorial designs: a tribute to Haim Hanani
Some non-isomorphic (4t + 4, 8t + 6, 4t + 3, 2t + 2, 2t + 1)-BIBD's
Discrete Mathematics
Automorphisms and Isomorphisms of Symmetric and Affine Designs
Journal of Algebraic Combinatorics: An International Journal
Bounds on the number of affine, symmetric, and Hadamard designs and matrices
Journal of Combinatorial Theory Series A
A New Bound on the Number of Designs with Classical Affine Parameters
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
The number of designs with geometric parameters grows exponentially
Designs, Codes and Cryptography
On the number of designs with affine parameters
Designs, Codes and Cryptography
Hi-index | 0.00 |
Two constructions are described that yield an improved lower bound for the number of 2-designs with the parameters of PG d (n, q), and a lower bound for the number of resolved 2-designs with the parameters of AG d (n, q).