Locally trivial t-designs and t-designs without repeated blocks

Authors:
L. Teirlinck
Affiliations:
-
Venue:
Discrete Mathematics - Combinatorial designs: a tribute to Haim Hanani
Year:
1989

Citing 0
Cited 4

There Exists a Simple Non Trivial t-designwith an Arbitrarily Large Automorphism Group for Every t

Designs, Codes and Cryptography
Simple non-trivial designs with an arbitrary automorphism group

Journal of Combinatorial Theory Series A
Optimization, block designs and no free lunch theorems

Information Processing Letters
Optimization, block designs and No Free Lunch theorems

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract