Premium
Finding simple t ‐designs with enumeration techniques
Author(s) -
Wassermann Alfred
Publication year - 1998
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1998)6:2<79::aid-jcd1>3.0.co;2-s
Subject(s) - enumeration , backtracking , mathematics , combinatorics , automorphism group , simple (philosophy) , automorphism , discrete mathematics , algorithm , philosophy , epistemology
Lattice basis reduction in combination with an efficient backtracking algorithm is used to find all (4 996 426) simple 7‐(33,8,10) designs with automorphism group PΓL(2, 32). © 1998 John Wiley & Sons, Inc. J Combin Designs 6:79–90, 1998